874 search results - page 154 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is ...
WG
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
EMSOFT
2007
Springer
15 years 3 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
IAT
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...