An Algorithm for SAT Without an Extraction Phase.
Pierluigi FriscoChristiaan V. HenkelSzabolcs TengelyPublished in: DNA (2005)
Keyphrases
- cost function
- theoretical analysis
- search space
- experimental evaluation
- times faster
- matching algorithm
- computational cost
- significant improvement
- learning algorithm
- recognition algorithm
- neural network
- tree structure
- clustering method
- optimization algorithm
- image segmentation
- particle swarm optimization
- k means
- improved algorithm
- probabilistic model
- dynamic programming
- np hard
- optimal solution
- randomly generated
- search strategy
- preprocessing phase
- detection algorithm
- simulated annealing
- worst case
- objective function
- decision trees