Sciweavers

15073 search results - page 257 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
QEST
2008
IEEE
15 years 10 months ago
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
Pritam Roy, David Parker, Gethin Norman, Luca de A...
ECCC
2008
98views more  ECCC 2008»
15 years 4 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
CCGRID
2009
IEEE
15 years 11 months ago
Modeling Job Lifespan Delays in Volunteer Computing Projects
Volunteer Computing (VC) projects harness the power of computers owned by volunteers across the Internet to perform hundreds of thousands of independent jobs. In VC projects, the ...
Trilce Estrada, Michela Taufer, Kevin Reed
NIPS
2004
15 years 5 months ago
Dynamic Bayesian Networks for Brain-Computer Interfaces
We describe an approach to building brain-computer interfaces (BCI) based on graphical models for probabilistic inference and learning. We show how a dynamic Bayesian network (DBN...
Pradeep Shenoy, Rajesh P. N. Rao
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
15 years 4 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek