Landscape analysis and efficient metaheuristics for solving the n-queens problem
AbstractThe n-queens problem is a classical combinatorial optimization problem which has been proved to be NP-hard. The goal is to place n non-attacking queens on an n×n chessboard. In this paper, two...
View ArticleBasic and Hybrid Imperialist Competitive Algorithms for Solving the...
AbstractIn the non-attacking n-queens problem the goal is to place n queens on an n×n chessboard such that no two queens are in the same row, column, or diagonal. In the non-dominating n-queens...
View ArticleStreamlining science with structured data archives: insights from stroke...
AbstractRecent advances in bibliometrics have focused on text-mining to organize scientific disciplines based on author networks, keywords, and citations. These approaches provide insights, but fail to...
View Article
More Pages to Explore .....
