A stochastic automaton-based algorithm for flexible and distributed network partitioning.
Yan WanSandip RoyAli SaberiBernard C. LesieutrePublished in: SIS (2005)
Keyphrases
- computational complexity
- k means
- distributed network
- dynamic programming
- np hard
- detection algorithm
- times faster
- improved algorithm
- search space
- cost function
- experimental evaluation
- graph partitioning
- preprocessing
- high accuracy
- monte carlo
- theoretical analysis
- stochastic approximation
- finite state automata
- genetic algorithm
- optimization algorithm
- probabilistic model
- segmentation algorithm
- particle swarm optimization
- matching algorithm
- worst case
- computational cost
- multi objective
- clustering algorithm
- neural network