608 search results - page 17 / 122 » On Dependent Randomized Rounding Algorithms |
144
click to vote
MOBICOM
2000
ACM
15 years 10 months ago
2000
ACM
In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin man...
158
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
159
click to vote
STOC
2006
ACM
15 years 11 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
160
click to vote
WAW
2007
Springer
15 years 12 months ago
2007
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
157
click to vote
NIPS
2003
15 years 7 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...