A Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments.
Edward A. HirschPublished in: Log. J. IGPL (1998)
Keyphrases
- cost function
- learning algorithm
- detection algorithm
- computational cost
- times faster
- high accuracy
- np hard
- optimal solution
- experimental evaluation
- significant improvement
- k means
- similarity measure
- preprocessing
- recognition algorithm
- worst case
- data structure
- input data
- neural network
- tree structure
- optimization algorithm
- convergence rate
- convex hull
- ant colony optimization
- estimation algorithm
- segmentation algorithm
- theoretical analysis
- computationally efficient
- probabilistic model
- dynamic programming
- data streams
- objective function