197 search results - page 1 / 40 » The Case for a Balanced Decomposition Process |
DSD
2009
IEEE
13 years 11 months ago
2009
IEEE
—We present experiments with synthesis tools using examples which are currently believed to be very hard, namely the LEKU examples by Cong and Minkovich and parity examples of ou...
FLAIRS
2006
13 years 6 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
ICA3PP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balan...
SYNASC
2007
IEEE
13 years 11 months ago
2007
IEEE
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...