14649 search results - page 2535 / 2930 » Principles of problem solving |
218
click to vote
AAAI
2000
15 years 9 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...
238
click to vote
SGP
2003
15 years 9 months ago
2003
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
191
click to vote
AIPS
2000
15 years 9 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
205
click to vote
UAI
2003
15 years 9 months ago
2003
This paper examines a number of solution methods for decision processes with non-Markovian rewards (NMRDPs). They all exploit a temporal logic specification of the reward functio...
232
Voted
UAI
2003
15 years 9 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...