520 search results - page 37 / 104 » New Complexity Results for Classical Planning Benchmarks |
WDAG
1998
Springer
14 years 22 days ago
1998
Springer
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
CODES
1999
IEEE
14 years 26 days ago
1999
IEEE
A well-known challenge during processor design is to obtain the best possible results for a typical target application domain that is generally described as a set of benchmarks. O...
TOSN
2010
13 years 6 months ago
2010
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
AIPS
2008
13 years 11 months ago
2008
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...