A complete anytime algorithm for balanced number partitioning
Stephan MertensPublished in: CoRR (1999)
Keyphrases
- computational complexity
- detection algorithm
- k means
- dynamic programming
- experimental evaluation
- space complexity
- times faster
- computational effort
- learning algorithm
- theoretical analysis
- high accuracy
- worst case
- computational cost
- data sets
- small number
- execution times
- recognition algorithm
- improved algorithm
- preprocessing
- expectation maximization
- memory requirements
- objective function
- similarity measure
- segmentation algorithm
- optimization algorithm
- classification algorithm
- matching algorithm
- single scan
- computationally efficient
- np complete
- support vector machine
- cost function
- significant improvement
- search space
- optimal solution
- genetic algorithm