 | 2009 |
|---|
| 12 |       | Boris Mitavskiy,
Chris Cannings:
Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms.
Evolutionary Computation 17(3): 343-377 (2009) |
| 2008 |
|---|
| 11 | | Boris Mitavskiy,
Jonathan E. Rowe,
Chris Cannings:
Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links.
IEEE Congress on Evolutionary Computation 2008: 1484-1491 |
| 10 | | Boris Mitavskiy,
Jonathan E. Rowe,
Alden H. Wright,
Lothar M. Schmitt:
Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm.
Genetic Programming and Evolvable Machines 9(2): 109-123 (2008) |
| 2007 |
|---|
| 9 | | Boris Mitavskiy,
Chris Cannings:
An improvement of the "quotient construction" method and further asymptotic results on the stationary distributions of the Markov chains modeling evolutionary algorithms.
IEEE Congress on Evolutionary Computation 2007: 2606-2613 |
| 2006 |
|---|
| 8 | | Boris Mitavskiy,
Jonathan E. Rowe,
Alden H. Wright,
Lothar M. Schmitt:
Exploiting Quotients of Markov Chains to Derive Properties of the Stationary Distribution of the Markov Chain Associated to an Evolutionary Algorithm.
SEAL 2006: 726-733 |
| 7 | | Boris Mitavskiy,
Jonathan E. Rowe:
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?.
Theory of Evolutionary Algorithms 2006 |
| 6 | | Boris Mitavskiy,
Jonathan E. Rowe:
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms.
Evolutionary Computation 14(1): 87-118 (2006) |
| 5 | | Boris Mitavskiy,
Jonathan E. Rowe:
Some results about the Markov chains associated to GPs and general EAs.
Theor. Comput. Sci. 361(1): 72-110 (2006) |
| 2005 |
|---|
| 4 | | Boris Mitavskiy,
Jonathan E. Rowe:
A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover.
FOGA 2005: 156-175 |
| 3 | | Andreas Blass,
Boris Mitavskiy:
NP-Completeness of Deciding Binary Genetic Encodability.
FOGA 2005: 58-74 |
| 2004 |
|---|
| 2 |  | Boris Mitavskiy:
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms.
Evolutionary Computation 12(1): 19-46 (2004) |
| 2003 |
|---|
| 1 | | Boris Mitavskiy:
Comparing Evolutionary Computation Techniques via Their Representation.
GECCO 2003: 1196-1209 |
