Basic and Hybrid Imperialist Competitive Algorithms for Solving the n-Queens Problem.
Ellips MasehianNasrin Mohabbati-KalejahiHossein AkbaripourPublished in: IJCCI (2012)
Keyphrases
- data structure
- significant improvement
- hybrid approaches
- computational complexity
- graph theory
- recently developed
- combinatorial optimization
- computational cost
- probabilistic model
- computationally efficient
- times faster
- orders of magnitude
- benchmark datasets
- computer vision
- learning algorithm
- computationally expensive
- real time
- search algorithm
- convergence rate
- np complete problems
- machine learning