874 search results - page 172 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
MOR
2008
14 years 9 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
109
click to vote
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
TIT
1998
14 years 9 months ago
1998
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
114
click to vote
FPGA
2010
ACM
14 years 10 months 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...
131
click to vote
AGENTS
2001
Springer
15 years 2 months ago
2001
Springer
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multi-agent tasks. We introduce a hierarchical multi-a...