1298 search results - page 98 / 260 » The online set cover problem |
279
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
281
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
154
click to vote
COCOON
2007
Springer
16 years 18 days ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
148
click to vote
AMDO
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Although the template fingerprint collected during the registration phase of personal verification systems can be considered in principle as representative of the subject...
166
click to vote
INFOCOM
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...