Sciweavers

1528 search results - page 207 / 306
» On Signatures for Communication Graphs
Sort
View
PLDI
2011
ACM
12 years 11 months ago
Isolating and understanding concurrency errors using reconstructed execution fragments
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
Brandon Lucia, Benjamin P. Wood, Luis Ceze
IPSN
2010
Springer
14 years 3 months ago
Multichannel reliability assessment in real world WSNs
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...
Jorge Ortiz, David E. Culler
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ISPASS
2006
IEEE
14 years 2 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...