Sciweavers

41 search results - page 3 / 9
» Conditional hardness for satisfiable 3-CSPs
Sort
View
ICALP
2007
Springer
14 years 14 days ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 6 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
DATE
2008
IEEE
114views Hardware» more  DATE 2008»
14 years 24 days ago
Synthesis of Fault-Tolerant Embedded Systems
This work addresses the issue of design optimization for faulttolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpoin...
Petru Eles, Viacheslav Izosimov, Paul Pop, Zebo Pe...
RTCSA
2008
IEEE
14 years 21 days ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
13 years 10 months ago
Object Modeling with Guaranteed Fulfillment of Geometric Constraints
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
Da-Chuan Cheng, Xiaoyi Jiang