Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
This paper presents a novel optimization approach using Improved Harmony Search (IHS) algorithm to solve economic power dispatch problem. The proposed methodology easily takes care...
V. Ravikumar Pandi, Bijaya K. Panigrahi, Manas Kum...
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...