13376 search results - page 466 / 2676 » Problem Solving with |
152
click to vote
CP
2010
Springer
15 years 3 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
138
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
We address the problem of estimating the three-dimensional shape and radiance of a surface in space from images obtained with different focal settings. We pose the problem as an in...
130
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
134
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
166
click to vote
AAAI
2008
15 years 7 months ago
2008
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...