Sciweavers

723 search results - page 128 / 145
» Exclusion for composite objects
Sort
View
VLDB
1994
ACM
115views Database» more  VLDB 1994»
13 years 11 months ago
Database Graph Views: A Practical Model to Manage Persistent Graphs
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
Alejandro Gutiérrez, Philippe Pucheral, Her...
WADT
1998
Springer
13 years 11 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...
ASAP
1997
IEEE
155views Hardware» more  ASAP 1997»
13 years 11 months ago
An Approach for Quantitative Analysis of Application-Specific Dataflow Architectures
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a qu...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
HLPPP
1991
13 years 11 months ago
Reasoning About Synchronic Groups
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
Gruia-Catalin Roman, H. Conrad Cunningham