Sciweavers

1381 search results - page 255 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
JAIR
2006
90views more  JAIR 2006»
13 years 7 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
PAMI
2006
132views more  PAMI 2006»
13 years 7 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
AROBOTS
2002
115views more  AROBOTS 2002»
13 years 7 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
ICUMT
2009
13 years 5 months ago
sDLS - Distributed Least Squares localization for large Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solut...
Ralf Behnke, Jakob Salzmann, Dominik Lieckfeldt, D...
AI
2011
Springer
13 years 2 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...