113 search results - page 12 / 23 » Arc Consistency during Search |
TROB
2010
13 years 6 months ago
2010
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
SAT
2004
Springer
14 years 27 days ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
ISTA
2003
13 years 9 months ago
2003
: With the increasing amount of information available on the Internet one of the most challenging tasks is to provide search interfaces that are easy to use without having to learn...
ICDCIT
2005
Springer
14 years 1 months ago
2005
Springer
The existing search engines sometimes give unsatisfactory search result for lack of any categorization. If there is some means to know the preference of user about the search resul...