1615 search results - page 105 / 323 » Pathology in heuristic search |
157
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
179
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
200
click to vote
LPAR
2012
Springer
14 years 2 months ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
167
click to vote
IJCAI
2003
15 years 7 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
136
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...