Login / Signup
Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions.
Carsten Witt
Published in:
Comb. Probab. Comput. (2013)
Keyphrases
</>
tight bounds
upper bound
linear functions
randomized search
lower bound
search algorithm
combinatorial optimization
simulated annealing
global optimization
optimization problems
worst case
dynamic programming
solution quality
optimal solution
machine learning
sample size
cost function
learning algorithm