Sciweavers

1806 search results - page 277 / 362
» Randomness and halting probabilities
Sort
View
HYBRID
2007
Springer
15 years 10 months ago
Symbolic Analysis for GSMP Models with One Stateful Clock
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
Mikhail Bernadsky, Rajeev Alur
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
15 years 10 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
15 years 10 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
INFOCOM
2006
IEEE
15 years 10 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
SKG
2006
IEEE
15 years 10 months ago
IAC: Interest-Aware Caching for Unstructured P2P
The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms re...
Xucheng Luo, Zhiguang Qin, Ji Geng, Jiaqing Luo