A polynomial time algorithm for the N-queens problem.
Eyas El-QawasmehKhader Al-NoubaniPublished in: Neural Networks and Computational Intelligence (2004)
Keyphrases
- computational complexity
- detection algorithm
- times faster
- recognition algorithm
- learning algorithm
- search space
- k means
- np hard
- computational cost
- theoretical analysis
- optimization algorithm
- worst case
- experimental evaluation
- dynamic programming
- special case
- preprocessing
- path planning
- tree structure
- equivalence queries
- computationally efficient
- particle swarm optimization
- input data
- linear programming
- high accuracy
- scheduling problem
- mobile robot
- video sequences
- optimal solution