Sciweavers

2354 search results - page 243 / 471
» Randomness, Stochasticity and Approximations
Sort
View
MOBIHOC
2009
ACM
16 years 6 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
INFOCOM
2005
IEEE
15 years 11 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
COCOON
2005
Springer
15 years 8 months ago
Solovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
Robert Rettinger, Xizhong Zheng
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
15 years 4 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
15 years 10 months ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston