Lower Bounds for the Average and Smoothed Number of Pareto Optima.
Navin GoyalLuis RademacherPublished in: FSTTCS (2012)
Keyphrases
- lower bound
- computational complexity
- standard deviation
- upper bound
- machine learning
- genetic algorithm
- evolutionary algorithm
- small number
- multi objective
- space complexity
- estimation error
- optimization algorithm
- constraint satisfaction problems
- linear programming
- real time
- objective function
- decision trees
- data sets