Unstable Throughput: When the Difficulty Algorithm Breaks.
Sam M. WernerDragos Ioan IlieIain StewartWilliam J. KnottenbeltPublished in: CoRR (2020)
Keyphrases
- computational complexity
- search space
- dynamic programming
- cost function
- computationally efficient
- matching algorithm
- detection algorithm
- computational cost
- k means
- learning algorithm
- np hard
- times faster
- objective function
- response time
- simulated annealing
- memory requirements
- neural network
- tree structure
- experimental study
- selection algorithm
- theoretical analysis
- particle swarm optimization
- high accuracy
- worst case
- experimental evaluation
- multi objective
- similarity measure