An algorithm for random signed 3-SAT with Intervals
Kathrin BallersteinDirk Oliver TheisPublished in: CoRR (2011)
Keyphrases
- matching algorithm
- learning algorithm
- computational complexity
- optimal solution
- preprocessing
- search space
- optimization algorithm
- np hard
- experimental evaluation
- randomly generated
- times faster
- high accuracy
- computational cost
- dynamic programming
- k means
- objective function
- cost function
- theoretical analysis
- similarity measure
- neural network
- probabilistic model
- significant improvement
- combinatorial optimization
- branch and bound
- convergence rate