activity
20062014
most citedA Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem

7 citations · 15 across the 9 of their papers we have counts for

collaborators

9 papers

cs.NE2014★ 7 cited

A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem

Jun He, Boris Mitavskiy, Yuren Zhou

Evolutionary algorithms are well suited for solving the knapsack problem. Some empirical studies claim that evolutionary algorithms can produce good solutions to the 0-1 knapsack p…

cs.DS2013

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

Boris Mitavskiy, Jun He

In the current work we introduce a novel estimation of distribution algorithm to tackle a hard combinatorial optimization problem, namely the single-machine scheduling problem, wit…

cs.NE2013

Geiringer Theorems: From Population Genetics to Computational Intelligence, Memory Evolutive Systems and Hebbian Learning

Boris Mitavskiy, Elio Tuci, Chris Cannings +2

The classical Geiringer theorem addresses the limiting frequency of occurrence of various alleles after repeated application of crossover. It has been adopted to the setting of evo…

cs.AI2013

A Further Generalization of the Finite-Population Geiringer-like Theorem for POMDPs to Allow Recombination Over Arbitrary Set Covers

Boris Mitavskiy, Jun He

A popular current research trend deals with expanding the Monte-Carlo tree search sampling methodologies to the environments with uncertainty and incomplete information. Recently a…

cs.NE2013

Combining Drift Analysis and Generalized Schema Theory to Design Efficient Hybrid and/or Mixed Strategy EAs

Boris Mitavskiy, Jun He

Hybrid and mixed strategy EAs have become rather popular for tackling various complex and NP-hard optimization problems. While empirical evidence suggests that such algorithms are…

cs.NE2012★ 4 cited

A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm

Boris Mitavskiy, Jun He

Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known tech…