589 search results - page 78 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
120
click to vote
JAIR
2008
14 years 11 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
111
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Evolutionary algorithms applied in real domain should profit from information about the local fitness function curvature. This paper presents an initial study of an evolutionary...
115
click to vote
HUMO
2007
Springer
15 years 3 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...