5316 search results - page 45 / 1064 » Which Search Problems Are Random |
106
Voted
JSW
2006
15 years 21 days ago
2006
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
119
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
83
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
For noisy optimization problems, there is generally a trade-off between the effort spent to reduce the noise (in order to allow the optimization algorithm to run properly), and t...
106
Voted
OL
2007
15 years 8 days ago
2007
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
98
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...