Sciweavers

1619 search results - page 17 / 324
» Structure in the Space of Value Functions
Sort
View
NIPS
2000
15 years 1 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
97
Voted
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 6 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
APPML
2002
58views more  APPML 2002»
14 years 11 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
ICFP
2007
ACM
15 years 11 months ago
Stream fusion: from lists to streams to nothing at all
This paper presents an automatic deforestation system, stream fusion, based on equational transformations, that fuses a wider range of functions than existing short-cut fusion sys...
Duncan Coutts, Roman Leshchinskiy, Don Stewart
NJC
2000
169views more  NJC 2000»
14 years 11 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann