On the Expected Complexity of Distributed Selection.
Nicola SantoroMichael ScheutzowJeffrey B. SidneyPublished in: J. Parallel Distributed Comput. (1988)
Keyphrases
- computational complexity
- cooperative
- distributed systems
- distributed environment
- selection criteria
- upper bound
- complexity analysis
- decision problems
- memory requirements
- distributed learning
- databases
- distributed architecture
- communication overhead
- selection strategy
- distributed computing
- communication cost
- selection algorithm
- peer to peer
- np hard
- data structure
- information systems
- genetic algorithm