504 search results - page 32 / 101 » Complexity Properties of Restricted Abstract Argument System... |
CC
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
EWSA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we motivate an Architecture Description Language (ADL) for mobile distributed systems based on the π-calculus. Different from other approaches, the non-fu...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
FUIN
2008
14 years 9 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
127
click to vote
CC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...