1355 search results - page 52 / 271 » Alternating Timed Automata over Bounded Time |
168
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
JCSS
2008
14 years 10 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
SASO
2008
IEEE
15 years 4 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
103
click to vote
REX
1991
15 years 1 months ago
1991
We survey logic-based and automata-based languages and techniques for the speci cation and veri cation of real-time systems. In particular, we discuss three syntactic extensions of...