We study the parameterized complexity of detecting small backdoor sets for instances of the
propositional satisfiability problem (SAT). The notion of backdoor sets has been recently …

In this paper, we investigate how adaptive operator selection techniques are able to
efficiently manage the balance between exploration and exploitation in an evolutionary …

This paper presents an experimental investigation of the following questions: how does the
average-case complexity of random 3-SAT, understood as a function of the order (number of …

Multiple known algorithmic paradigms (backtracking, local search and the polynomial
method) only yield a 2 n (1-1/O (k)) time algorithm for k-SAT in the worst case. For this …

A new parallel hybrid method for solving the satisfiability problem that combines cellular
genetic algorithms and the random walk (WSAT) strategy of GSAT is presented. The method …

Compilation to Boolean satisfiability has become a powerful paradigm for solving artificial
intelligence problems. However, domains that require metric reasoning cannot be compiled …

In this paper, we show how quantum Boolean circuits can be used to implement the oracle
and the inversion-about-average function in Grover's search algorithm. Before illustrating …

Abstract The Particle Swarm Optimizer is modified to create the Adaptive Particle Swarm
Optimizer. This variation is better able to locate and track optima in dynamic environments …

With the rapid development of network communication technology, identity authentication
based on smart cards is one of the most common two-factor authentication schemes. In …

Recent years have seen a growth in the use of algorithmic techniques, and especially formal
methods, in reverse engineering. Depending on the motivation and requirements of the …