1547 search results - page 27 / 310 » Randomized Variable Elimination |
251
click to vote
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
147
click to vote
CPC
2011
14 years 9 months ago
2011
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
118
click to vote
IFL
1997
Springer
15 years 6 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
HPCA
2007
IEEE
16 years 2 months ago
2007
IEEE
As process technologies continue to scale, the magnitude of within-die device parameter variations is expected to increase and may lead to significant timing variability. This pap...
114
click to vote
ASPDAC
2005
ACM
15 years 4 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...