1542 search results - page 145 / 309 » The metamathematics of random graphs |
103
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
102
click to vote
ENTCS
2008
15 years 2 months ago
2008
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 ...
110
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
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...
113
click to vote
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
109
click to vote
SASO
2008
IEEE
15 years 8 months ago
2008
IEEE
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...