Sciweavers

313 search results - page 24 / 63
» Redundancy Elimination for LF
Sort
View
PEPM
1998
ACM
15 years 4 months ago
Type-Directed Partial Evaluation
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
Olivier Danvy
CGO
2003
IEEE
15 years 5 months ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein
AUSAI
2004
Springer
15 years 5 months ago
A Dynamic Allocation Method of Basis Functions in Reinforcement Learning
In this paper, we propose a dynamic allocation method of basis functions, an Allocation/Elimination Gaussian Softmax Basis Function Network (AE-GSBFN), that is used in reinforcemen...
Shingo Iida, Kiyotake Kuwayama, Masayoshi Kanoh, S...
DAC
2003
ACM
15 years 5 months ago
Realizable RLCK circuit crunching
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
Chirayu S. Amin, Masud H. Chowdhury, Yehea I. Isma...
DAM
1999
100views more  DAM 1999»
14 years 11 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder