610 search results - page 91 / 122 » Solving Geometrical Place Problems by using Evolutionary Alg... |
162
click to vote
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
168
Voted
EDBT
2012
ACM
13 years 5 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
140
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
126
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
126
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...