A Linear Time Randomizing Algorithm for Searching Ranked Functions.
Eitan ZemelPublished in: Algorithmica (1987)
Keyphrases
- experimental evaluation
- worst case
- learning algorithm
- search space
- times faster
- dynamic programming
- cost function
- np hard
- objective function
- k means
- improved algorithm
- computational cost
- linear programming
- optimization algorithm
- upper bound
- probabilistic model
- computational complexity
- particle swarm optimization
- convergence rate
- basis functions
- path planning
- input data
- recognition algorithm
- selection algorithm
- string matching
- clustering method
- detection algorithm
- theoretical analysis
- expectation maximization
- neural network
- search engine
- significant improvement
- preprocessing