466 search results - page 17 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
70
Voted
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
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...
91
Voted
NIPS
2003
14 years 11 months ago
2003
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...
CP
2004
Springer
15 years 2 months ago
2004
Springer
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...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
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...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
– 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...