An algorithm for random signed 3-SAT with intervals.
Kathrin BallersteinDirk Oliver TheisPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- computational cost
- learning algorithm
- dynamic programming
- preprocessing
- similarity measure
- times faster
- simulated annealing
- randomly generated
- recognition algorithm
- detection algorithm
- optimal solution
- neural network
- np hard
- particle swarm optimization
- expectation maximization
- theoretical analysis
- cost function
- clustering method
- significant improvement
- computational complexity
- image sequences
- experimental evaluation
- worst case
- np complete
- tree structure
- matching algorithm
- lower bound