Sciweavers

194 search results - page 7 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
NIPS
1994
13 years 9 months ago
Generalization in Reinforcement Learning: Safely Approximating the Value Function
To appear in: G. Tesauro, D. S. Touretzky and T. K. Leen, eds., Advances in Neural Information Processing Systems 7, MIT Press, Cambridge MA, 1995. A straightforward approach to t...
Justin A. Boyan, Andrew W. Moore
PLILP
1994
Springer
13 years 12 months ago
Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
John Field, Frank Tip
WSCG
2000
164views more  WSCG 2000»
13 years 9 months ago
Color-Table Animation of Fast Oriented Line Integral Convolution for Vector Field Visualization
Fast Oriented Line Integral Convolution (FROLIC), which is a variant of LIC, illustrates 2D vector fields by approximating a streamlet by a set of disks with varying intensity. FR...
Siegrun Berger, Eduard Gröller
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 2 months ago
Nonholonomic source seeking in switching random fields
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pa...
SAGA
2005
Springer
14 years 1 months ago
Dynamic Facility Location with Stochastic Demands
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...
Martin Romauch, Richard F. Hartl