638 search results - page 7 / 128 » A New Approach to Tractable Planning |
ESA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
AAAI
1997
13 years 8 months ago
1997
Mixed-initiative planning envisions a framework in which automated and human planners interact to jointly construct plans that satisfy specific objectives. In this paper, we repo...
CP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...