Sciweavers

4131 search results - page 307 / 827
» Compactness in Topology and Computation
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
A Scalable VLSI Architecture for Binary Prefix Sums
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
Rong Lin, Koji Nakano, Stephan Olariu, Maria Crist...
222
Voted
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 11 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
SAC
1998
ACM
15 years 11 months ago
A specification language for the WIDE workflow model
This paper presents a workflow specification language developed in the WIDE project. The language provides a rich organisation model, an information model including presentation d...
Daniel K. C. Chan, Jochem Vonk, Gabriel Sanchez, P...
157
Voted
DAC
1993
ACM
15 years 10 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...
FOSSACS
2006
Springer
15 years 10 months ago
Denotational Semantics of Hybrid Automata
Abstract. We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is d...
Abbas Edalat, Dirk Pattinson