2657 search results - page 314 / 532 » On the complexity of hierarchical problem solving |
179
click to vote
AIPS
2008
15 years 9 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
176
click to vote
CCCG
2010
15 years 8 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
186
click to vote
IPCO
2007
15 years 8 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
174
click to vote
PUK
2001
15 years 8 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
161
click to vote
UAI
2004
15 years 8 months ago
2004
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...