1595 search results - page 65 / 319 » An Evolutionary Local Search Algorithm for the Satisfiabilit... |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
GECCO
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...