Sciweavers

4940 search results - page 843 / 988
» On the Complexity of Universal Programs
Sort
View
HICSS
1996
IEEE
123views Biometrics» more  HICSS 1996»
15 years 10 months ago
Concurrency: A Case Study in Remote Tasking and Distributed IPC
Remote tasking encompasses different functionality, such as remote forking, multiple remote spawning, and task migration. In order to overcome the relatively high costs of these m...
Dejan S. Milojicic, Alan Langerman, David L. Black...
CP
1997
Springer
15 years 10 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
IPPS
1996
IEEE
15 years 10 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
HYBRID
1997
Springer
15 years 10 months ago
Time-Deterministic Hybrid Transition Systems
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...
Simin Nadjm-Tehrani
LCPC
1997
Springer
15 years 10 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju