1095 search results - page 78 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
105
click to vote
DAC
2004
ACM
15 years 11 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
IEAAIE
2007
Springer
15 years 4 months ago
2007
Springer
The process scheduling aims to arrange CPU time to multiple processes for providing users with more efficient throughput. Except the class of process set by user, conventional oper...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
EOR
2008
14 years 10 months ago
2008
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. E...