Sciweavers

1806 search results - page 42 / 362
» Randomness and halting probabilities
Sort
View
ITSL
2008
13 years 9 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu
MFCS
1995
Springer
13 years 11 months ago
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
Wolfgang Merkle, Yongge Wang
ICC
2007
IEEE
129views Communications» more  ICC 2007»
14 years 1 months ago
Performance Evaluation of CDMA Cellular Systems Considering both the Soft Capacity Constraint and Users' Smooth Random Mobility
— A new call admission control (CAC) strategy based on the soft capacity constraint (SCC) concept is proposed for CDMA cellular systems. The use of the SCC concept allows maximiz...
Carmen B. Rodríguez-Estrello, Felipe A. Cru...
WWW
2010
ACM
14 years 2 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...