Sciweavers

350 search results - page 49 / 70
» Branching Programs for Tree Evaluation
Sort
View
PLDI
1995
ACM
13 years 11 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
UM
2005
Springer
14 years 1 months ago
User Modeling in a Distributed E-Learning Architecture
Abstract: This paper is focused on user modeling and adaptation in distributed ELearning systems. We describe here CUMULATE, a generic student modeling server developed for a distr...
Peter Brusilovsky, Sergey A. Sosnovsky, Olena Shch...
BIBE
2000
IEEE
110views Bioinformatics» more  BIBE 2000»
13 years 11 months ago
FURY: Fuzzy Unification and Resolution Based on Edit Distance
We present a theoretically founded framework for fuzzy unification and resolution based on edit distance over trees. Our framework extends classical unification and resolution con...
David Gilbert, Michael Schroeder
ICS
1999
Tsinghua U.
13 years 12 months ago
Software trace cache
—This paper explores the use of compiler optimizations which optimize the layout of instructions in memory. The target is to enable the code to make better use of the underlying ...
Alex Ramírez, Josep-Lluis Larriba-Pey, Carl...
SPAA
2012
ACM
11 years 10 months ago
Memory-mapping support for reducer hyperobjects
hyperobjects (reducers) provide a linguistic abstraction for dynamic multithreading that allows different branches of a parallel program to maintain coordinated local views of the...
I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leis...