Boris Mitavskiy

发表

Combining drift analysis and generalized schema theory to design efficient hybrid and/or mixed strategy EAs

Jun He, Boris Mitavskiy, Jun He, 2013, 2013 IEEE Congress on Evolutionary Computation.

A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem

Yuren Zhou, Jun He, Boris Mitavskiy, 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

A version of Geiringer-like theorem for decision making in the environments with randomness and incomplete information pdf

Jonathan E. Rowe, Boris Mitavskiy, Chris Cannings, 2012, Int. J. Intell. Comput. Cybern..

Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning

Elio Tuci, Jun He, Jonathan E. Rowe, 2013, Natural Computing.

Exploiting Quotients of Markov Chains to Derive Properties of the Stationary Distribution of the Markov Chain Associated to an Evolutionary Algorithm

Alden H. Wright, Jonathan E. Rowe, Boris Mitavskiy, 2006, SEAL.

Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments pdf

Jun He, Boris Mitavskiy, 2013, ArXiv.

An improvement of the “quotient construction” method and further asymptotic results on the stationary distributions of the Markov chains modeling evolutionary algorithms

Boris Mitavskiy, Chris Cannings, 2007, 2007 IEEE Congress on Evolutionary Computation.

On the evolution of self-organised role-allocation and role-switching behaviour in swarm robotics: a case study

Gianpiero Francesca, Elio Tuci, Boris Mitavskiy, 2013, ECAL.

Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases

Boris Mitavskiy, Chris Cannings, C. Cannings, 2008, Theory of Evolutionary Algorithms.

Some results about the Markov chains associated to GPs and general EAs

Jonathan E. Rowe, Boris Mitavskiy, J. Rowe, 2006, Theor. Comput. Sci..

Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links

Jonathan E. Rowe, Boris Mitavskiy, Chris Cannings, 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

A polynomial time approximation scheme for a single machine scheduling problem using a hybrid evolutionary algorithm

Boris Mitavskiy, Jun He, Jun He, 2012, 2012 IEEE Congress on Evolutionary Computation.

Comparing Evolutionary Computation Techniques via Their Representation

Boris Mitavskiy, 2003, GECCO.

An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms

Jonathan E. Rowe, Boris Mitavskiy, 2006, Evolutionary Computation.

A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers pdf

Jun He, Boris Mitavskiy, 2013, FOGA XII '13.

A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover

Jonathan E. Rowe, Boris Mitavskiy, J. Rowe, 2005, FOGA.

Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm

Alden H. Wright, Jonathan E. Rowe, Boris Mitavskiy, 2007, Genetic Programming and Evolvable Machines.

A Novel Analysis of Super Linear Population Speedup in Elitist Evolutionary Algorithms

Boris Mitavskiy, Jun He, Tianshi Chen, 2011 .

Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms

Boris Mitavskiy, Chris Cannings, C. Cannings, 2009, Evolutionary Computation.

How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?

Jonathan E. Rowe, Boris Mitavskiy, J. Rowe, 2006, Theory of Evolutionary Algorithms.

Novel Analysis of Population Scalability in Evolutionary Algorithms

Tianshi Chen, Jun He, Boris Mitavskiy, 2011 .

Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms

Boris Mitavskiy, 2004, Evolutionary Computation.

Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

Jonathan E. Rowe, Boris Mitavskiy, Chris Cannings, 2009, Int. J. Intell. Comput. Cybern..

NP-Completeness of Deciding Binary Genetic Encodability

Andreas Blass, Boris Mitavskiy, 2005, FOGA.

An extension of geiringer's theorem for a wide class of evolutionary search algorithms

Jonathan E. Rowe, Boris Mitavskiy, J. Rowe, 2006 .

Models of transcription factor binding: sensitivity of activation functions to model assumptions.

Dominique Chu, Boris Mitavskiy, Nicolae Radu Zabet, 2009, Journal of theoretical biology.