105 search results - page 14 / 21 » A Lower Bound on the Competitive Ratio of Truthful Auctions |
90
Voted
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
152
Voted
SCHEDULING
2011
14 years 4 months ago
2011
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
WIOPT
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...