5580 search results - page 262 / 1116 » Randomized priority algorithms |
163
click to vote
RSA
2002
15 years 6 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
195
click to vote
DASFAA
2011
IEEE
14 years 10 months ago
2011
IEEE
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
165
click to vote
SIGECOM
2009
ACM
16 years 26 days ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
139
Voted
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
171
Voted
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...