Sciweavers

6506 search results - page 1102 / 1302
» Algorithmic models for sensor networks
Sort
View
127
Voted
DSN
2007
IEEE
15 years 7 months ago
Automatic Verification and Discovery of Byzantine Consensus Protocols
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
Piotr Zielinski
SASO
2010
IEEE
15 years 1 months ago
Extracting Overlay Invariants of Distributed Systems for Autonomic System Management
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
Hanhuai Shan, Guofei Jiang, Kenji Yoshihira
123
Voted
PADS
2004
ACM
15 years 8 months ago
Simulation Validation Using Direct Execution of Wireless Ad-Hoc Routing Protocols
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
Jason Liu, Yougu Yuan, David M. Nicol, Robert S. G...
BMCBI
2007
127views more  BMCBI 2007»
15 years 3 months ago
Characterization and simulation of cDNA microarray spots using a novel mathematical model
Background: The quality of cDNA microarray data is crucial for expanding its application to other research areas, such as the study of gene regulatory networks. Despite the fact t...
Hye Young Kim, Seo Eun Lee, Min Jung Kim, Jin Il H...
ICALP
2009
Springer
16 years 3 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
« Prev « First page 1102 / 1302 Last » Next »