The Fault Tolerance of NP-Hard Problems.
Christian GlaßerAduri PavanStephen D. TraversPublished in: LATA (2009)
Keyphrases
- np hard problems
- fault tolerance
- fault tolerant
- constraint programming
- np hard
- knapsack problem
- distributed systems
- load balancing
- combinatorial search
- response time
- graph coloring
- fault management
- replicated databases
- failure recovery
- peer to peer
- mobile agents
- database replication
- single point of failure
- constraint satisfaction problems
- constraint satisfaction
- heuristic search
- computational intelligence
- digital libraries
- component failures
- special case