182 search results - page 35 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
143
click to vote
FPGA
2010
ACM
15 years 21 days ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
130
click to vote
BMCBI
2008
15 years 19 days ago
2008
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
115
Voted
LCTRTS
2009
Springer
15 years 7 months ago
2009
Springer
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
113
Voted
BMCBI
2008
15 years 19 days ago
2008
Background: Inferring gene regulatory networks from data requires the development of algorithms devoted to structure extraction. When only static data are available, gene interact...
107
Voted
CORR
2010
Springer
15 years 18 days ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...