Sciweavers

486 search results - page 80 / 98
» Improved upper bounds for 3-SAT
Sort
View
166
Voted
FOCS
2007
IEEE
16 years 1 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
IPPS
2007
IEEE
16 years 1 months ago
A Configuration Control Mechanism Based on Concurrency Level for a Reconfigurable Consistency Algorithm
A Reconfigurable Consistency Algorithm (RCA) is an algorithm that guarantees the consistency in Distributed Shared Memory (DSM) Systems. In a RCA, there is a Configuration Control...
Christiane V. Pousa, Luís Fabrício W...
CPAIOR
2007
Springer
16 years 26 days ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
EMSOFT
2007
Springer
16 years 26 days ago
E-FRP with priorities
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
Roumen Kaiabachev, Walid Taha, Angela Yun Zhu
CGO
2006
IEEE
16 years 23 days ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann