216 search results - page 19 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
RAS
1998
13 years 7 months ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
IJNM
2000
13 years 7 months ago
2000
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults ...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
AAAI
1998
13 years 9 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
SPRINGSIM
2010
13 years 6 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...