A Reduction Theorem for the Verification of Round-Based Distributed Algorithms.
Mouna Chaouch-SaadBernadette Charron-BostStephan MerzPublished in: RP (2009)
Keyphrases
- data structure
- recently developed
- times faster
- optimization problems
- computational efficiency
- neural network
- learning algorithm
- lightweight
- model checking
- distributed computation
- database
- computing environments
- combinatorial optimization
- orders of magnitude
- benchmark datasets
- distributed systems
- computational cost
- significant improvement
- lower bound
- computational complexity
- decision trees