4377 search results - page 68 / 876 » Mass problems and randomness |
RSA
2006
14 years 9 months ago
2006
: Using the cavity equations of M
107
click to vote
WIOPT
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
ACSC
2005
IEEE
15 years 3 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
MOR
2008
14 years 9 months ago
2008
Abstract. We propose a new solution method for optimal stopping problems with random discounting for linear diffusions whose state space has a combination of natural, absorbing, or...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...