Sciweavers

564 search results - page 14 / 113
» Approximation algorithms for restricted Bayesian network str...
Sort
View
JCO
2007
149views more  JCO 2007»
15 years 10 days ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang
105
Voted
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 5 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
102
Voted
IJAR
2006
89views more  IJAR 2006»
15 years 13 days ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
UAI
2003
15 years 1 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
SAT
2005
Springer
145views Hardware» more  SAT 2005»
15 years 6 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman