Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm.
Dominique CansellDominique MéryPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- incremental version
- theoretical analysis
- times faster
- learning algorithm
- single pass
- computational cost
- dynamic programming
- distributed breakout
- incremental algorithms
- computational complexity
- image processing algorithms
- algorithms require
- distributed systems
- computationally efficient
- computational efficiency
- highly efficient
- recently developed
- worst case
- classification algorithm
- significant improvement
- distributed environment
- cost function
- k means
- convergence rate
- synthetic and real datasets
- filtering algorithm
- synthetic datasets
- empirical analyses
- benchmark problems
- incremental learning
- memory requirements
- noisy data
- maximum flow
- optimal solution
- evolutionary algorithm
- combinatorial optimization
- related algorithms
- multi agent
- optimization problems
- iterative algorithms
- preprocessing
- data structure
- distributed constraint optimization problems
- objective function
- space complexity
- exhaustive search
- solution quality
- matching algorithm
- ant colony optimization
- optimization algorithm
- simulated annealing
- np hard
- multi objective