Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances.
Ana NikolikjSaso DzeroskiMario Andrés MuñozCarola DoerrPeter KorosecTome EftimovPublished in: GECCO (2023)
Keyphrases
- np hard
- learning algorithm
- times faster
- computational complexity
- experimental evaluation
- high accuracy
- convergence rate
- matching algorithm
- computationally efficient
- significant improvement
- dynamic programming
- recognition algorithm
- theoretical analysis
- cost function
- computationally demanding
- improved algorithm
- optimal solution
- search algorithm
- preprocessing
- classification algorithm
- optimization algorithm
- search space
- segmentation algorithm
- clustering method
- genetic algorithm
- worst case
- convex hull
- upper bound
- support vector machine
- k means
- lower and upper bounds
- version space
- special case
- instance space