3454 search results - page 163 / 691 » Modern computer algebra |
179
click to vote
ENTCS
2008
15 years 6 months ago
2008
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
165
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
205
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
161
click to vote
FSEN
2009
Springer
16 years 1 months ago
2009
Springer
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
146
click to vote
EUROPAR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...