2714 search results - page 167 / 543 » Approximation Schemes for Scheduling |
118
click to vote
COORDINATION
2006
Springer
15 years 4 months ago
2006
Springer
The coordination language Paradigm allows for a flexible and orthogonal modeling of interprocess relationships at the architectural level. It is shown how dynamic system adaptation...
121
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
101
click to vote
CCGRID
2003
IEEE
15 years 6 months ago
2003
IEEE
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
115
click to vote
ALGORITHMICA
2002
15 years 21 days ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
144
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...