Sciweavers

295 search results - page 59 / 59
» SAT, SMT and Applications
Sort
View
JELIA
2004
Springer
13 years 10 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
CF
2010
ACM
13 years 10 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
CONEXT
2009
ACM
13 years 5 months ago
Feasibility of content dissemination between devices in moving vehicles
We investigate the feasibility of content distribution between devices mounted in moving vehicles using commodity WiFi. We assume that each device stores content in a set of files...
Thomas Zahn, Greg O'Shea, Antony I. T. Rowstron
ECCC
2007
86views more  ECCC 2007»
13 years 4 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 4 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen