Sciweavers

366 search results - page 50 / 74
» Dynamic Programming for Graphs on Surfaces
Sort
View
116
Voted
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
15 years 6 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
107
Voted
CUZA
2002
129views more  CUZA 2002»
15 years 1 months ago
Ad Hoc Metacomputing with Compeer
Metacomputing allows the exploitation of geographically seperate, heterogenous networks and resources. Most metacomputers are feature rich and carry a long, complicated installati...
Keith Power, John P. Morrison
IPPS
2010
IEEE
14 years 11 months ago
Parallelization of tau-leap coarse-grained Monte Carlo simulations on GPUs
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
Lifan Xu, Michela Taufer, Stuart Collins, Dionisio...
118
Voted
SIGSOFT
2010
ACM
14 years 11 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
JMLR
2010
149views more  JMLR 2010»
14 years 8 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...