5316 search results - page 53 / 1064 » Which Search Problems Are Random |
112
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
119
Voted
IBIS
2006
15 years 24 days ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
136
Voted
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
103
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
INFORMATICALT
2006
15 years 23 days ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...