2355 search results - page 157 / 471 » Scheduling in the Z-Polyhedral Model |
170
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
149
click to vote
DSRT
2000
IEEE
15 years 10 months ago
2000
IEEE
The problem of network bundwidth limitutions is encountered in ulmost uny distributed virtuul environment or networkedgume. In U typicul client-serversetup, where the virtuul worl...
132
click to vote
WSC
2008
15 years 8 months ago
2008
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
141
click to vote
IEICET
2006
15 years 6 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
133
Voted
JAIR
2006
15 years 6 months ago
2006
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...