16 search results - page 2 / 4 » Minimizing Maximum Flow-time on Related Machines |
JCO
2007
13 years 4 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
DAGSTUHL
2007
13 years 6 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...