Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano