Sciweavers

SIPEW
2009
Springer
110views Hardware» more  SIPEW 2009»
14 years 3 months ago
A Note on the Effects of Service Time Distribution in the M/G/1 Queue
The M/G/1 queue is a classical model used to represent a large number of real-life computer and networking applications. In this note, we show that, for coefficients of variation o...
Alexandre Brandwajn, Thomas Begin
SIPEW
2009
Springer
119views Hardware» more  SIPEW 2009»
14 years 3 months ago
A Tale of Two Processors: Revisiting the RISC-CISC Debate
The contentious debates between RISC and CISC have died down, and a CISC ISA, the x86 continues to be popular. Nowadays, processors with CISC-ISAs translate the CISC instructions i...
Ciji Isen, Lizy K. John, Eugene John
SAT
2009
Springer
90views Hardware» more  SAT 2009»
14 years 3 months ago
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
SAT
2009
Springer
91views Hardware» more  SAT 2009»
14 years 3 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
SAT
2009
Springer
94views Hardware» more  SAT 2009»
14 years 3 months ago
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
Timo Berthold, Stefan Heinz, Marc E. Pfetsch
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 3 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
SAT
2009
Springer
94views Hardware» more  SAT 2009»
14 years 3 months ago
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
SAT
2009
Springer
82views Hardware» more  SAT 2009»
14 years 3 months ago
Generalizing Core-Guided Max-SAT
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
Mark H. Liffiton, Karem A. Sakallah
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 3 months ago
Exploiting Cycle Structures in Max-SAT
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
Chu Min Li, Felip Manyà, Nouredine Ould Moh...