841 search results - page 110 / 169 » Approximability of Minimum AND-Circuits |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
STOC
1995
ACM
14 years 1 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
ALT
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...