A genetic local tuning algorithm for a class of combinatorial networks design problems.
Hameida SayoudKenzo TakahashiBenoît VaillantPublished in: IEEE Commun. Lett. (2001)
Keyphrases
- dynamic programming
- cost function
- np hard
- segmentation algorithm
- theoretical analysis
- computationally efficient
- detection algorithm
- learning algorithm
- k means
- recognition algorithm
- computational cost
- computational complexity
- preprocessing
- times faster
- high accuracy
- experimental evaluation
- objective function
- convergence rate
- parameter tuning
- parameter settings
- input data
- worst case
- significant improvement
- search space
- support vector
- social networks