Sciweavers

466 search results - page 17 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
70
Voted
ICCV
2005
IEEE
15 years 11 months ago
Guiding Model Search Using Segmentation
In this paper we show how a segmentation as preprocessing paradigm can be used to improve the efficiency and accuracy of model search in an image. We operationalize this idea usin...
Greg Mori
91
Voted
NIPS
2003
14 years 11 months ago
Bounded Finite State Controllers
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
Pascal Poupart, Craig Boutilier
CP
2004
Springer
15 years 2 months ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
CEC
2005
IEEE
15 years 3 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
IROS
2006
IEEE
97views Robotics» more  IROS 2006»
15 years 3 months ago
Probabilistic Search for a Moving Target in an Indoor Environment
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
Haye Lau, Shoudong Huang, Gamini Dissanayake