A distributed fault-tolerant asynchronous algorithm for performing N tasks.
Gehan WeerasingheLester LipskyPublished in: CATA (2001)
Keyphrases
- fault tolerant
- dynamic programming
- fault tolerance
- learning algorithm
- preprocessing
- distributed systems
- np hard
- interconnection networks
- parallel implementation
- expectation maximization
- simulated annealing
- optimal solution
- metadata
- worst case
- k means
- search space
- peer to peer
- computational complexity
- multi agent systems
- multi agent