Sciweavers

333 search results - page 16 / 67
» Speeding up moving-target search
Sort
View
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
14 years 11 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...
GECCO
2003
Springer
107views Optimization» more  GECCO 2003»
15 years 3 months ago
Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
T. Q. S. Truong, A. Stacey
IROS
2006
IEEE
112views Robotics» more  IROS 2006»
15 years 4 months ago
Multi-robot Aggregation Strategies with Limited Communication
– The limited power, low radio range, and an ever changing environment make the ability to explicitly communicate between multi-robots decreases in a searching task. When this ha...
Yan Meng, Jeffrey V. Nickerson, Jing Gan
CPAIOR
2005
Springer
15 years 3 months ago
Computing Explanations for the Unary Resource Constraint
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
Petr Vilím
106
Voted
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
15 years 10 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle