3454 search results - page 213 / 691 » Modern computer algebra |
135
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port model. In this mode...
158
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In distributed-memory message-passing architectures reducing communication cost is extremely important. In this paper, we present a technique to optimize communication globally. O...
158
click to vote
ICS
1997
Tsinghua U.
15 years 10 months ago
1997
Tsinghua U.
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
137
click to vote
CONCUR
1990
Springer
15 years 10 months ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
153
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...