1552 search results - page 24 / 311 » On the Complexity of Constant Propagation |
IJCAI
1997
15 years 3 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
127
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
212
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
98
Voted
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...
115
Voted
CP
2010
Springer
15 years 14 days ago
2010
Springer
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...