Sciweavers

1421 search results - page 59 / 285
» Satisfying KBO Constraints
Sort
View
CP
1995
Springer
13 years 11 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace
AAAI
1996
13 years 9 months ago
Trajectory Constraints in Qualitative Simulation
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
Giorgio Brajnik, Daniel J. Clancy
ASIAN
2009
Springer
299views Algorithms» more  ASIAN 2009»
13 years 9 months ago
Deducibility Constraints
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
ICEIS
2006
IEEE
14 years 2 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
CHES
2005
Springer
100views Cryptology» more  CHES 2005»
14 years 1 months ago
Masked Dual-Rail Pre-charge Logic: DPA-Resistance Without Routing Constraints
During the last years, several logic styles that counteract side-channel attacks have been proposed. They all have in common that their level of resistance heavily depends on imple...
Thomas Popp, Stefan Mangard