An empirical study of a scalable Byzantine agreement algorithm.
Olumuyiwa OluwasanmiJared SaiaValerie KingPublished in: IPDPS Workshops (2010)
Keyphrases
- computational cost
- expectation maximization
- cost function
- matching algorithm
- detection algorithm
- single pass
- preprocessing
- search space
- significant improvement
- dynamic programming
- objective function
- times faster
- theoretical analysis
- learning algorithm
- high accuracy
- fault tolerant
- experimental evaluation
- computational complexity
- np hard
- feature selection
- improved algorithm
- similarity measure
- search algorithm
- path planning
- classification algorithm
- clustering method
- least squares
- optimization algorithm
- segmentation algorithm
- computationally efficient
- probabilistic model
- particle swarm optimization
- simulated annealing