102 search results - page 16 / 21 » A Stochastic Local Search Approach to Vertex Cover |
JAIR
2008
14 years 11 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
171
click to vote
CP
2009
Springer
16 years 8 days ago
2009
Springer
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
128
click to vote
ENTCS
2007
14 years 11 months ago
2007
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
HEURISTICS
2006
14 years 11 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
SLS
2009
Springer
15 years 6 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...