3454 search results - page 528 / 691 » Modern computer algebra |
DEDS
2008
13 years 9 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
ENTCS
2008
13 years 9 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
CONCURRENCY
2006
13 years 9 months ago
2006
vices provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. In this scenario, applications, like sc...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...