105 search results - page 11 / 21 » A Lower Bound on the Competitive Ratio of Truthful Auctions |
COCOON
2007
Springer
15 years 3 months 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...
78
Voted
SIGECOM
2004
ACM
15 years 2 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
64
Voted
SIROCCO
2007
14 years 11 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
103
Voted
IOPADS
1997
14 years 11 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...