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...
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...
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...
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...
– 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...