The Probabilistic Analysis of a Greedy Satisfiability Algorithm.
Alexis C. KaporisLefteris M. KirousisEfthimios G. LalasPublished in: ESA (2002)
Keyphrases
- computational complexity
- search space
- dynamic programming
- optimization algorithm
- detection algorithm
- np hard
- significant improvement
- locally optimal
- probabilistic model
- learning algorithm
- greedy algorithm
- theoretical analysis
- preprocessing
- cost function
- optimal solution
- input data
- worst case
- recognition algorithm
- greedy algorithms
- context free parsing
- particle swarm optimization
- high accuracy
- experimental evaluation
- times faster
- computational cost
- improved algorithm
- objective function
- feature selection