A Lower Bound for Randomized Searching on m Rays.
Sven SchuiererPublished in: Computer Science in Perspective (2003)
Keyphrases
- lower bound
- upper bound
- randomized algorithm
- branch and bound algorithm
- randomized algorithms
- optimal solution
- branch and bound
- worst case
- objective function
- np hard
- greedy algorithm
- sample complexity
- lower bounding
- privacy preserving association rule mining
- data sets
- sufficiently accurate
- competitive ratio
- lower and upper bounds
- search strategies
- data structure
- neural network