1595 search results - page 32 / 319 » An Evolutionary Local Search Algorithm for the Satisfiabilit... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Multimodal optimization problems consist in detecting all global and local optima of a problem. A new evolutionary approach to multimodal optimization called Roaming technique (RO...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...