Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization.
Stefan DrosteThomas JansenIngo WegenerPublished in: Theory Comput. Syst. (2006)
Keyphrases
- black box
- upper and lower bounds
- search heuristics
- upper bound
- black boxes
- lower bound
- lower and upper bounds
- constraint programming
- white box
- optimization problems
- search algorithm
- tabu search
- white box testing
- search strategy
- test cases
- beam search
- data mining
- evolutionary algorithm
- simulated annealing
- training data
- integration testing
- machine learning