A decentralized algorithm for balancing a strongly connected weighted digraph.
Attilio PrioloAndrea GasparriEduardo MontijanoCarlos SagüésPublished in: ACC (2013)
Keyphrases
- dynamic programming
- learning algorithm
- cost function
- preprocessing
- computational cost
- significant improvement
- neural network
- strongly connected
- detection algorithm
- segmentation algorithm
- high accuracy
- computational complexity
- k means
- special case
- image segmentation
- experimental evaluation
- simulated annealing
- expectation maximization
- cooperative
- optimal solution
- objective function
- clustering algorithm
- np hard
- evolutionary algorithm
- times faster
- directed graph
- undirected graph