An efficient algorithm for solving the token distribution problem on k-ary d-cube networks.
Claude G. DiderichMarc GenglerStéphane UbédaPublished in: ISPAN (1994)
Keyphrases
- optimization algorithm
- computational complexity
- k means
- experimental evaluation
- dynamic programming
- computationally efficient
- detection algorithm
- learning algorithm
- similarity measure
- theoretical analysis
- np hard
- probabilistic model
- input data
- neural network
- worst case
- probability distribution
- recognition algorithm
- improved algorithm
- combinatorial optimization
- times faster
- graphical models
- network structure
- convex hull
- linear systems
- linear program
- particle swarm optimization
- linear programming
- high accuracy
- computational cost
- objective function
- social networks
- genetic algorithm