Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors.
Ephraim KorachShlomo MoranShmuel ZaksPublished in: Theor. Comput. Sci. (1989)
Keyphrases
- lower bound
- worst case
- peer to peer
- learning algorithm
- objective function
- distributed network
- optimization problems
- mobile sensor
- lower and upper bounds
- exhaustive search
- upper bound
- data structure
- network traffic
- distributed environment
- error bounds
- parallel processing
- communication cost
- distributed systems
- simulated annealing
- parallel processors
- single processor