2354 search results - page 366 / 471 » Assignment Problems |
108
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
140
Voted
DILS
2009
Springer
15 years 9 months ago
2009
Springer
Probabilistic functional integrated networks are powerful tools with which to draw inferences from high-throughput data. However, network analyses are generally not tailored to spe...
138
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
104
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
107
Voted
SLIP
2009
ACM
15 years 9 months ago
2009
ACM
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...