Sciweavers

3514 search results - page 69 / 703
» A search space
Sort
View
IBERAMIA
2004
Springer
14 years 2 months ago
A Multi-robot Strategy for Rapidly Searching a Polygonal Environment
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
DATE
2002
IEEE
80views Hardware» more  DATE 2002»
14 years 1 months ago
Test Planning and Design Space Exploration in a Core-Based Environment
This paper proposes a comprehensive model for test planning in a core-based environment. The main contribution of this work is the use of several types of TAMs and the considerati...
Érika F. Cota, Luigi Carro, Marcelo Lubasze...
ICIP
2007
IEEE
14 years 10 months ago
Epipolar Spaces and Optimal Sampling Strategies
If precise calibration information is unavailable, as is often the case for active binocular vision systems, the determination of epipolar lines becomes untenable. Yet, even witho...
James Monaco, Alan C. Bovik, Lawrence K. Cormack
ECCC
2007
99views more  ECCC 2007»
13 years 9 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder