Sciweavers

617 search results - page 67 / 124
» On the Chromatic Number of Random Graphs
Sort
View
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
15 years 6 months ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
MSWIM
2006
ACM
15 years 5 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
COLT
2008
Springer
15 years 1 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
ENTCS
2008
95views more  ENTCS 2008»
14 years 12 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 14 days ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald