5214 search results - page 47 / 1043 » The Online Specialization Problem |
SODA
2010
ACM
14 years 5 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 7 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 ...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
SWAT
2004
Springer
14 years 29 days ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
GREC
2003
Springer
14 years 25 days ago
2003
Springer
A brief survey on on-line graphics recognition is presented. We first present some common scenarios and applications of on-line graphics recognition and then identify major problem...