Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...