520 search results - page 33 / 104 » New Complexity Results for Classical Planning Benchmarks |
FLAIRS
2006
13 years 11 months ago
2006
RUPART1 is a hybrid robot control system for navigating a real-world, academic building. Hybrid robot control systems provide robust low-level navigation together with strategic p...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
ICCAD
2005
IEEE
14 years 6 months ago
2005
IEEE
Modern design requirements have brought additional complexities to netlists and layouts. Millions of components, whitespace resources, and fixed/movable blocks are just a few to ...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...