Sciweavers

21 search results - page 2 / 5
» On the approximate domain optimization of deterministic and ...
Sort
View
TIT
1998
99views more  TIT 1998»
13 years 5 months ago
Information-Theoretic Image Formation
—The emergent role of information theory in image formation is surveyed. Unlike the subject of information-theoretic communication theory, information-theoretic imaging is far fr...
Joseph A. O'Sullivan, Richard E. Blahut, Donald L....
CORR
2012
Springer
235views Education» more  CORR 2012»
12 years 1 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
FOCS
2004
IEEE
13 years 9 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
ICML
1996
IEEE
14 years 6 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 9 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld