1552 search results - page 110 / 311 » On the Complexity of Constant Propagation |
141
click to vote
DSN
2003
IEEE
15 years 11 months ago
2003
IEEE
—We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the sta...
151
click to vote
SAC
1996
ACM
15 years 10 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
185
click to vote
ISMIS
1994
Springer
15 years 10 months ago
1994
Springer
Main stream approaches in distributed artificial intelligence (DAI) are essentially logic-based. Little has been reported to explore probabilistic approach in DAI. On the other han...
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
145
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...