20 search results - page 1 / 4 » Theoretical Analysis of Heuristic Search Methods for Online ... |
NIPS
2007
14 years 18 days ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
JAIR
2008
13 years 11 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
CSCLP
2005
Springer
14 years 4 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
ACCV
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. A tracking-by-detection framework is proposed that combines nearest-neighbor classification of bags of features, efficient subwindow search, and a novel feature selection...
ESA
2008
Springer
14 years 28 days ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...