2566 search results - page 41 / 514 » The Online Median Problem |
STOC
1991
ACM
14 years 1 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
RTSS
1994
IEEE
14 years 2 months ago
1994
IEEE
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
The existence and use of standard test collections in information retrieval experimentation allows results to be compared between research groups and over time. Such comparisons, ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
ORDER
2007
13 years 10 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...