Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
Ofer BiranShlomo MoranShmuel ZaksPublished in: Theor. Comput. Sci. (1995)
Keyphrases
- tight bounds
- upper bound
- computational complexity
- distributed systems
- special case
- cooperative
- distributed environment
- worst case
- multi agent
- np hard
- peer to peer
- lightweight
- distributed data
- loosely coupled
- objective function
- case study
- neural network
- computational cost
- website
- knowledge base
- e learning
- feature selection
- resource allocation
- search engine
- multi task
- artificial intelligence