We present several algorithms for simultaneous SAT (propositional satisfiability) based model checking of safety properties. More precisely, we focus on Bounded Model Checking and ...
Zurab Khasidashvili, Alexander Nadel, Amit Palti, ...
—Evolutionary gradient search is a hybrid algorithm that exploits the complementary features of gradient search and evolutionary algorithm to achieve a level of efficiency and r...
Chi Keong Goh, Yew-Soon Ong, Kay Chen Tan, Eu Jin ...
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...