1893 search results - page 299 / 379 » Computational composites |
ERSHOV
1999
Springer
14 years 12 days ago
1999
Springer
The traditional representation of a program is as a linear sequence of text. At some stage in the execution sequence the source text is checked for type correctness and its transla...
IPPS
1998
IEEE
14 years 11 days ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
ICDCS
1996
IEEE
14 years 8 days ago
1996
IEEE
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
LICS
1996
IEEE
14 years 8 days ago
1996
IEEE
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee)...
TAPSOFT
1997
Springer
14 years 8 days ago
1997
Springer
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...