2254 search results - page 441 / 451 » Computing the minimal covering set |
EUROPAR
2005
Springer
14 years 3 months ago
2005
Springer
Whereas the established interconnection networks (ICTN) achieve low latency by operating in the linear region, i.e. oversizing the fabric, the recent strict cost and power constrai...
JSSPP
2005
Springer
14 years 3 months ago
2005
Springer
Irregular and iterative I/O-intensive jobs need a different approach from parallel job schedulers. The focus in this case is not only the processing requirements anymore: memory, ...
RAID
2005
Springer
14 years 3 months ago
2005
Springer
Intrusion detection systems are fundamentally passive and fail–open. Because their primary task is classification, they do nothing to prevent an attack from succeeding. An intru...
ASIAN
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...