125 search results - page 11 / 25 » Transforming Normal Programs by Replacement |
JCP
2007
13 years 7 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
ICDE
1993
IEEE
13 years 11 months ago
1993
IEEE
In this article, different techniques for 'pointer swizzling" are classified and evaluated for optimizing the access to main-memory resident persistent objects. To speed ...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
TOG
2002
13 years 7 months ago
2002
Shadow maps are probably the most widely used means for the generation of shadows, despite their well known aliasing problems. In this paper we introduce perspective shadow maps, ...
LISP
2007
13 years 7 months ago
2007
: The Krivine machine is a simple and natural implementation of the normal weak-head reduction strategy for pure λ-terms. While its original description has remained unpublished, ...