13026 search results - page 2401 / 2606 » Creativity and Artificial Intelligence |
153
click to vote
CP
2005
Springer
16 years 6 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...
158
click to vote
CP
2005
Springer
16 years 6 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...
200
click to vote
CP
2005
Springer
16 years 6 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...
194
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
168
click to vote
DIGRA
2005
Springer
16 years 6 days ago
2005
Springer
We describe a technique to manage pre-written lines of dialog by treating a conversation as a game. Thinking of conversation as a game means structuring it as a series of moves, m...