1538 search results - page 58 / 308 » Relative Randomness and Cardinality |
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
102
click to vote
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
STOC
1990
ACM
15 years 1 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
SAFECOMP
2000
Springer
15 years 1 months ago
2000
Springer
Increasingly, the dependability of vehicle based programmable systems is becoming a key feature in ensuring the safety of those in and around the vehicle. The goal of those respons...