Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm.
Rhonda Kay GaedeM. Ray MercerBill UnderwoodPublished in: ITC (1986)
Keyphrases
- objective function
- preprocessing
- learning algorithm
- optimal solution
- optimization algorithm
- computational complexity
- worst case
- np hard
- linear programming
- probabilistic model
- experimental evaluation
- dynamic programming
- detection algorithm
- times faster
- lower bound
- recognition algorithm
- memory efficient
- theoretical analysis
- similarity measure
- high accuracy
- multi objective
- search space
- convex hull
- error bounds
- memory requirements
- data structure
- lower and upper bounds
- average case