882 search results - page 37 / 177 » Local Search for Very Large SAT Problems |
GECCO
2010
Springer
14 years 12 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 ...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
107
click to vote
EMO
2009
Springer
14 years 9 months ago
2009
Springer
Traditionally, Predator-Prey Models--although providing a more nature-oriented approach to multi-objective optimization than many other standard Evolutionary Multi-Objective Algori...
EVOW
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
AAAI
1998
15 years 1 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...