On the Distributed Bellman-Ford Algorithm and the Looping Problem.
Kevin R. HutsonTerri L. SchlosserDouglas R. ShierPublished in: INFORMS J. Comput. (2007)
Keyphrases
- experimental evaluation
- dynamic programming
- computational complexity
- learning algorithm
- theoretical analysis
- worst case
- computational cost
- np hard
- simulated annealing
- cost function
- k means
- optimization algorithm
- times faster
- particle swarm optimization
- selection algorithm
- improved algorithm
- piecewise linear
- high accuracy
- significant improvement
- search space
- preprocessing
- data structure
- optimal solution
- multi agent
- hidden markov models
- peer to peer
- input data
- tree structure
- memory requirements
- recognition algorithm
- multi robot
- objective function