Sciweavers

4502 search results - page 618 / 901
» Regular Model Checking
Sort
View
ADHOC
2008
78views more  ADHOC 2008»
15 years 6 months ago
Asymptotic uniform data-rate guarantees in large wireless networks
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
Xin Liu, R. Srikant
CORR
2010
Springer
52views Education» more  CORR 2010»
15 years 6 months ago
Weighted Logics for Nested Words and Algebraic Formal Power Series
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study neste...
Christian Mathissen
CORR
2010
Springer
207views Education» more  CORR 2010»
15 years 6 months ago
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
This paper presents a simple local medium access control protocol, called Jade, for multi-hop wireless networks with a single channel that is provably robust against adaptive adver...
Andréa W. Richa, Christian Scheideler, Stef...
DAM
2008
69views more  DAM 2008»
15 years 6 months ago
Impact of memory size on graph exploration capability
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
ECCC
2008
117views more  ECCC 2008»
15 years 6 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...