13090 search results - page 2415 / 2618 » Usable artificial intelligence |
188
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
171
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
147
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
154
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
192
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...