This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Tetris is a falling block game where the player’s objective is to arrange a sequence of different shaped tetrominoes smoothly in order to survive. In the intelligence games, ag...
— We extend the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) by collaborative concepts from Particle Swarm Optimization (PSO). The proposed Particle Swarm CMA-ES...
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...