2681 search results - page 218 / 537 » Problem F |
77
Voted
AAAI
2007
15 years 3 months ago
2007
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
101
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
STOC
2003
ACM
16 years 1 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
107
Voted
PODS
2007
ACM
16 years 27 days ago
2007
ACM
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
91
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...