Sciweavers

9 search results - page 1 / 2
» Case Studies with Lurette V2
Sort
View
ISOLA
2004
Springer
13 years 10 months ago
Case Studies with Lurette V2
Abstract. Lurette is an automated testing tool dedicated to reactive programs. The test process is automated at two levels: given a formal description of the System Under Test (SUT...
Erwan Jahier, Pascal Raymond, Philippe Baufreton
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 5 months ago
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
Daniel W. Cranston, Gexin Yu
INFOCOM
2012
IEEE
11 years 7 months ago
Data naming in Vehicle-to-Vehicle communications
—Vehicular networking is becoming reality. Today vehicles use TCP/IP to communicate with centralized servers through cellular networks. However many vehicular applications, such ...
Lucas Wang, Ryuji Wakikawa, Romain Kuntz, Rama Vuy...
ADCM
2008
112views more  ADCM 2008»
13 years 5 months ago
Frames in spaces with finite rate of innovation
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
Qiyu Sun
SIAMDM
2008
154views more  SIAMDM 2008»
13 years 4 months ago
On the First-Fit Chromatic Number of Graphs
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
József Balogh, Stephen G. Hartke, Qi Liu, G...