A Probabilistic Analysis of a New Satisfiability Algorithm.
Bruno ApolloniSalvatore Di GregorioPublished in: RAIRO Theor. Informatics Appl. (1982)
Keyphrases
- computational complexity
- detection algorithm
- improved algorithm
- preprocessing
- high accuracy
- learning algorithm
- theoretical analysis
- cost function
- worst case
- randomly generated
- times faster
- computationally efficient
- experimental evaluation
- computational cost
- convergence rate
- classification algorithm
- ant colony optimization
- search space
- significant improvement
- np hard
- dynamic programming
- probabilistic model
- linear programming
- graphical models
- segmentation algorithm
- data analysis
- similarity measure
- image sequences
- genetic algorithm