874 search results - page 24 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
107
click to vote
EOR
2010
14 years 7 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
PARCO
1997
14 years 11 months ago
1997
This article is devoted to the run-time redistribution of arrays that are distributed in a blockcyclic fashion over a multidimensional processor grid. While previous studies have ...