Sciweavers

819 search results - page 133 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
95
Voted
PLDI
2011
ACM
14 years 1 months ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
82
Voted
ICPPW
2002
IEEE
15 years 3 months ago
Quantitative Analysis of Transmission Power Control in Wireless Ad-hoc Networks
Abstract—In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that minimum transmission power achieves the opt...
Seung-Jong Park, Raghupathy Sivakumar
107
Voted
PODC
2011
ACM
14 years 1 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
105
Voted
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
15 years 2 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
92
Voted
PODC
2005
ACM
15 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer