6036 search results - page 1067 / 1208 » Web search solved |
159
click to vote
IJCAI
2003
15 years 6 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
121
Voted
AAAI
1998
15 years 6 months ago
1998
In design, multiple disparate goals must be addressed simultaneously. It is the thesis of this work that problems in two-dimensional layout design can be solved by collaboration a...
144
Voted
AAAI
1998
15 years 6 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
145
click to vote
AAAI
2000
15 years 6 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
122
Voted
AIPS
2000
15 years 6 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...