4370 search results - page 446 / 874 » Algebra of Logic Programming |
129
Voted
PLDI
1997
ACM
15 years 7 months ago
1997
ACM
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
207
Voted
FPCA
1995
15 years 7 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
115
Voted
NIPS
2000
15 years 4 months ago
2000
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...
99
Voted
LFP
1990
15 years 4 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
122
click to vote
FOCM
2007
15 years 3 months ago
2007
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...