2714 search results - page 187 / 543 » Approximation Schemes for Scheduling |
123
click to vote
AOR
2007
15 years 3 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
160
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
141
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
169
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
144
click to vote
RTSS
2008
IEEE
15 years 10 months ago
2008
IEEE
Reliability-aware power management (RAPM) schemes have been recently studied to save energy while preserving system reliability. The existing RAPM schemes, however, provision for ...