The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...