1730 search results - page 246 / 346 » Algebra and Computation |
127
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
134
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
118
click to vote
ISPDC
2007
IEEE
15 years 10 months ago
2007
IEEE
We present in this paper multi-thread and multi-process parallelizations of the Fast Multipole Method (FMM) for Laplace equation, for uniform and non uniform distributions. These ...
137
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
130
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...