A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems.
Avrim BlumHoward J. KarloffYuval RabaniMichael E. SaksPublished in: SIAM J. Comput. (2000)
Keyphrases
- randomized algorithms
- database
- optimization problems
- expert systems
- intelligent systems
- specific problems
- np complete
- upper bound
- information systems
- artificial intelligence
- evolutionary algorithm
- search engine
- web server
- solving problems
- average case
- learning algorithm
- decomposition algorithm
- high end
- technical issues
- information retrieval