Sciweavers

2880 search results - page 296 / 576
» Approximate Range Searching
Sort
View
122
Voted
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
15 years 10 months ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
FOCS
2006
IEEE
15 years 9 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
149
Voted
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 9 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
127
Voted
EPIA
1997
Springer
15 years 7 months ago
GenSAT: A Navigational Approach
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
Yury V. Smirnov, Manuela M. Veloso
150
Voted
IFIPTCS
2000
15 years 7 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen