328 search results - page 31 / 66 » Proving Termination of Communicating Programs |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
ISCC
2003
IEEE
14 years 1 months ago
2003
IEEE
The advent of the cooperating IP-enabled heterogeneous radio networks will offer, under the “Beyond 3G” vision, ubiquitous services. In this new challenging context, a novel a...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...