Sciweavers

1204 search results - page 24 / 241
» Hybrid Probabilistic Programs
Sort
View
ICDCS
2003
IEEE
14 years 1 months ago
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
This paper studies the problem of updates in decentralised and self-organising P2P systems in which peers have low online probabilities and only local knowledge. The update strate...
Anwitaman Datta, Manfred Hauswirth, Karl Aberer
ICRA
2003
IEEE
127views Robotics» more  ICRA 2003»
14 years 1 months ago
The bridge test for sampling narrow passages with probabilistic roadmap planners
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create s...
David Hsu, Tingting Jiang, John H. Reif, Zheng Sun
CSDA
2008
128views more  CSDA 2008»
13 years 8 months ago
On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...
Chris H. Q. Ding, Tao Li, Wei Peng
ISMB
1996
13 years 10 months ago
The Mathematical Model of Subtractive Hybridization and Its Practical Application
A novel theory of subtractive hybridization including (or based on) the kinetic model of this process was proposed. A computer program modeling the process of subtraction wasdevel...
Olga D. Ermolaeva, Sergey A. Lukyanov, Eugene D. S...
COCO
1998
Springer
86views Algorithms» more  COCO 1998»
14 years 27 days ago
The Satisfiability Problem for Probabilistic Ordered Branching Programs
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is NP-complete. If the error is very small, however (more precisely, if the erro...
Manindra Agrawal, Thomas Thierauf