From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.
Hubie ChenVíctor DalmauPublished in: CSL (2005)
Keyphrases
- computational complexity
- dynamic programming
- learning algorithm
- matching algorithm
- computational cost
- improved algorithm
- feature selection
- experimental evaluation
- genetic algorithm
- recognition algorithm
- detection algorithm
- theoretical analysis
- linear programming
- high accuracy
- cost function
- search space
- search algorithm
- data structure
- data sets
- worst case
- significant improvement
- segmentation algorithm
- video sequences
- monte carlo
- times faster
- convergence rate
- similarity measure
- fictitious play
- two player games