Sciweavers

4542 search results - page 832 / 909
» Design patterns for data structures
Sort
View
RTA
1995
Springer
15 years 3 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
SC
1995
ACM
15 years 3 months ago
Detecting Coarse - Grain Parallelism Using an Interprocedural Parallelizing Compiler
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates...
Mary W. Hall, Saman P. Amarasinghe, Brian R. Murph...
EDBT
1992
ACM
111views Database» more  EDBT 1992»
15 years 3 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
CSCLP
2008
Springer
15 years 1 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
IE
2007
15 years 1 months ago
Dramatic flow in interactive 3D narrative
The concept of dramatic level is crucial for a model of dramatic flow. We present a framework to maintain optimal dramatic flow in an interactive 3D environment where both linea...
Alyx Macfadyen, Andrew Stranieri, John Yearwood