Sciweavers

194 search results - page 2 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
13 years 8 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
CSEE
2010
Springer
13 years 5 months ago
An Undergraduate Summer Research Program in Software Safety
This paper shares the experiences and lessons learned from conducting an NSF-sponsored eight-week summer research program for ten undergraduate students from multiple universities...
W. Eric Wong, Vidroha Debroy
QRE
2010
129views more  QRE 2010»
13 years 5 months ago
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
Rajesh Ganesan, Poornima Balakrishna, Lance Sherry
NIPS
2001
13 years 8 months ago
Linking Motor Learning to Function Approximation: Learning in an Unlearnable Force Field
Reaching movements require the brain to generate motor commands that rely on an internal model of the task's dynamics. Here we consider the errors that subjects make early in...
O. Donchin, Reza Shadmehr
FATES
2006
Springer
13 years 10 months ago
Dynamic Architecture Extraction
Abstract. Object models capture key properties of object-oriented architectures, and they can highlight relationships between types, occurrences of sharing, and object encapsulatio...
Cormac Flanagan, Stephen N. Freund