Sciweavers

1547 search results - page 199 / 310
» Randomized Variable Elimination
Sort
View
121
Voted
ASM
2010
ASM
15 years 5 months ago
Formal Probabilistic Analysis: A Higher-Order Logic Based Approach
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
Osman Hasan, Sofiène Tahar
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 5 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
CONCUR
1997
Springer
15 years 4 months ago
Probabilistic Concurrent Constraint Programming
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
103
Voted
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 4 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
104
Voted
ASPDAC
2007
ACM
82views Hardware» more  ASPDAC 2007»
15 years 4 months ago
Fast Buffer Insertion for Yield Optimization Under Process Variations
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...
Ruiming Chen, Hai Zhou