176 search results - page 9 / 36 » Optimal Sampling Strategies in Quicksort |
AROBOTS
2005
14 years 9 months ago
2005
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
JMLR
2006
14 years 9 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
86
Voted
ICRA
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...