Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Stefan DrosteThomas JansenIngo WegenerPublished in: Electron. Colloquium Comput. Complex. (2003)
Keyphrases
- black box
- upper and lower bounds
- search heuristics
- upper bound
- black boxes
- white box
- lower bound
- lower and upper bounds
- evolutionary algorithm
- optimization problems
- tabu search
- constraint programming
- test cases
- genetic algorithm
- integration testing
- white box testing
- beam search
- sample complexity
- knapsack problem
- metaheuristic
- search algorithm
- learning algorithm
- decision trees