Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity.
Yi YangShuigeng ZhouJihong GuanPublished in: FAW (2014)
Keyphrases
- worst case
- computational complexity
- space complexity
- experimental evaluation
- dynamic programming
- randomly generated
- times faster
- preprocessing
- high accuracy
- computational cost
- detection algorithm
- cost function
- significant improvement
- segmentation algorithm
- learning algorithm
- computer games
- similarity measure
- probabilistic model
- search space
- lower bound
- tree structure
- monte carlo
- matching algorithm
- optimal solution
- objective function