While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
A major contribution to global warming has been the number of new workshops publishing proceedings with the prefix hot. In this article, I propose that we counter this trend in an...
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Abstract— This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is...