176 search results - page 29 / 36 » Optimal Sampling Strategies in Quicksort |
122
click to vote
JMLR
2012
12 years 12 months ago
2012
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
ILP
2004
Springer
15 years 2 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
76
Voted
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We revisit Gaussian Adaptation (GaA), a black-box optimizer for discrete and continuous problems that has been developed in the late 1960’s. This largely neglected sear...
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
— The success of sampling-based motion planners has resulted in a plethora of methods for improving planning components, such as sampling and connection strategies, local planner...