Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
Abu Sayef Md. Ishaque, Md. Bahlul Haider, Muhammad...
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...