Sciweavers

5393 search results - page 500 / 1079
» Spatial Computing with Labels
Sort
View
CONCUR
1998
Springer
15 years 12 months ago
Alternating Refinement Relations
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, ...
GD
1998
Springer
15 years 12 months ago
Improved Force-Directed Layouts
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
Emden R. Gansner, Stephen C. North
FTDCS
1997
IEEE
15 years 12 months ago
Analysing the behaviour of distributed software architectures: a case study
A Software Architecture is the overall structure of a system in terms of its constituent components and their interconnections. In this paper, we describe work to associate behavi...
Jeff Magee, Jeff Kramer, Dimitra Giannakopoulou
DAC
1993
ACM
15 years 11 months ago
Rotation Scheduling: A Loop Pipelining Algorithm
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Me...
CIE
2009
Springer
15 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch