Sciweavers

15073 search results - page 2 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
FLAIRS
2000
14 years 6 days ago
Zooming in on Trade-Offs in Qualitative Probabilistic Networks
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. As a consequence of their coarse level of representation detail, qualitativ...
Silja Renooij, Linda C. van der Gaag, Shaw Green, ...
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
14 years 3 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
CORR
2004
Springer
108views Education» more  CORR 2004»
13 years 10 months ago
Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
Kumara Sastry, David E. Goldberg, Martin Pelikan
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
15 years 6 days ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
UAI
2000
14 years 5 days ago
Pivotal Pruning of Trade-offs in QPNs
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...
Silja Renooij, Linda C. van der Gaag, Simon Parson...