Boris Mitavskiy

29 papers A 4B 5Journal 15Unranked 4
YearRankTypeTitle / Venue / Authors
2014 J jnl
A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem.
CoRR
Jun He, Boris Mitavskiy, Yuren Zhou
2014 B conf
A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem.
IEEE Congress on Evolutionary Computation
Jun He, Boris Mitavskiy, Yuren Zhou
2013 J jnl
A Further Generalization of the Finite-Population Geiringer-like Theorem for POMDPs to Allow Recombination Over Arbitrary Set Covers.
CoRR
Boris Mitavskiy, Jun He
2013 A conf
A further generalization of the finite-population geiringer-like theorem for pomdps to allow recombination overarbitrary set covers.
FOGA
Boris Mitavskiy, Jun He
2013 J jnl
Combining Drift Analysis and Generalized Schema Theory to Design Efficient Hybrid and/or Mixed Strategy EAs
CoRR
Boris Mitavskiy, Jun He
2013 B conf
Combining drift analysis and generalized schema theory to design efficient hybrid and/or mixed strategy EAs.
IEEE Congress on Evolutionary Computation
Boris Mitavskiy, Jun He
2013 J jnl
Design and Analysis of an Estimation of Distribution Approximation Algorithm for Single Machine Scheduling in Uncertain Environments.
CoRR
Boris Mitavskiy, Jun He
2013 J jnl
Geiringer Theorems: From Population Genetics to Computational Intelligence, Memory Evolutive Systems and Hebbian Learning
CoRR
Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He
2013 J jnl
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning.
Nat. Comput.
Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He
2013 — conf
On the evolution of self-organised role-allocation and role-switching behaviour in swarm robotics: a case study.
ECAL
Elio Tuci, Boris Mitavskiy, Gianpiero Francesca
2012 J jnl
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm
CoRR
Boris Mitavskiy, Jun He
2012 B conf
A polynomial time approximation scheme for a single machine scheduling problem using a hybrid evolutionary algorithm.
IEEE Congress on Evolutionary Computation
Boris Mitavskiy, Jun He
2012 J jnl
A version of Geiringer-like theorem for decision making in the environments with randomness and incomplete information.
Int. J. Intell. Comput. Cybern.
Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings
2011 J jnl
A Version of Geiringer-like Theorem for Decision Making in the Environments with Randomness and Incomplete Information
CoRR
Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings
2009 J jnl
Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms.
Evol. Comput.
Boris Mitavskiy, Chris Cannings
2009 J jnl
Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links.
Int. J. Intell. Comput. Cybern.
Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings
2008 — conf
Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases.
Theory of Evolutionary Algorithms
Boris Mitavskiy, Chris Cannings
2008 B conf
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
Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings
2008 J jnl
Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm.
Genet. Program. Evolvable Mach.
Boris Mitavskiy, Jonathan E. Rowe, Alden H. Wright, Lothar M. Schmitt
2007 B conf
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
Boris Mitavskiy, Chris Cannings
2006 J jnl
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms.
Evol. Comput.
Boris Mitavskiy, Jonathan E. Rowe
2006 — conf
Exploiting Quotients of Markov Chains to Derive Properties of the Stationary Distribution of the Markov Chain Associated to an Evolutionary Algorithm.
SEAL
Boris Mitavskiy, Jonathan E. Rowe, Alden H. Wright, Lothar M. Schmitt
2006 — conf
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
Boris Mitavskiy, Jonathan E. Rowe
2006 J jnl
Some results about the Markov chains associated to GPs and general EAs.
Theor. Comput. Sci.
Boris Mitavskiy, Jonathan E. Rowe
2005 A conf
A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover.
FOGA
Boris Mitavskiy, Jonathan E. Rowe
2005 A conf
NP-Completeness of Deciding Binary Genetic Encodability.
FOGA
Andreas Blass, Boris Mitavskiy
2004 — —
A mathematical model of evolutionary computation and some consequences.
Boris Mitavskiy
2004 J jnl
Crossover Invariant Subsets of the Search Space for Evolutionary Algorithms.
Evol. Comput.
Boris Mitavskiy
2003 A conf
Comparing Evolutionary Computation Techniques via Their Representation.
GECCO
Boris Mitavskiy