170 search results - page 26 / 34 » Solving Simple Planning Problems with More Inference and No ... |
NIPS
1993
13 years 8 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We propose a novel method to detect human poses in videos by concurrently optimizing body part matching and object segmentation. With a single exemplar image, the propose...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...