Sciweavers

2924 search results - page 413 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2006
IEEE
15 years 11 months ago
Timed automata based analysis of embedded system architectures
We show that timed automata can be used to model and to analyze timeliness properties of embedded system architectures. Using a case study inspired by industrial practice, we pres...
Martijn Hendriks, Marcel Verhoef
ICDCS
2005
IEEE
15 years 10 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
ISPAN
2005
IEEE
15 years 10 months ago
The structure of super line graphs
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
Jay Bagga, Daniela Ferrero
STACS
2005
Springer
15 years 10 months ago
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
Nir Ailon, Bernard Chazelle
ICNP
2000
IEEE
15 years 9 months ago
A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
Haiyun Luo, Songwu Lu