An Efficient Perfect Algorithm for Memory Repair Problems.
Hung-Yau LinFu-Min YehIng-Yi ChenSy-Yen KuoPublished in: DFT (2004)
Keyphrases
- computationally efficient
- optimal or near optimal
- optimization algorithm
- memory usage
- benchmark problems
- detection algorithm
- k means
- improved algorithm
- memory requirements
- memory space
- highly efficient
- theoretical analysis
- combinatorial optimization
- times faster
- computational complexity
- clustering method
- np hard
- learning algorithm
- test problems
- objective function
- matching algorithm
- probabilistic model
- experimental evaluation
- dynamic programming
- ant colony optimization
- data sets
- segmentation algorithm
- convex hull
- particle swarm optimization
- optimization problems
- worst case
- similarity measure
- theoretical guarantees
- significant improvement