Sciweavers

7065 search results - page 155 / 1413
» Iterative Scheduling Algorithms
Sort
View
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 5 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
119
Voted
CG
2004
Springer
15 years 4 months ago
Recursive turtle programs and iterated affine transformations
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
Tao Ju, Scott Schaefer, Ron Goldman
ICASSP
2011
IEEE
14 years 8 months ago
Iterative hard thresholding for compressed sensing with partially known support
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
Rafael E. Carrillo, Luisa F. Polania, Kenneth E. B...
ICPPW
2009
IEEE
15 years 11 months ago
Evaluation of Existing Schedulability Tests for Global EDF
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...
Marko Bertogna
124
Voted
IPPS
1999
IEEE
15 years 9 months ago
Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Sz...