On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem.
Sandi KlavzarUros MilutinovicCiril PetrPublished in: Discret. Appl. Math. (2002)
Keyphrases
- learning algorithm
- computational complexity
- preprocessing
- cost function
- times faster
- k means
- dynamic programming
- detection algorithm
- segmentation algorithm
- bayesian networks
- recognition algorithm
- computationally efficient
- expectation maximization
- particle swarm optimization
- high accuracy
- computational cost
- experimental evaluation
- probabilistic model
- np hard
- search space
- matching algorithm
- optimal solution
- objective function
- selection algorithm