|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 9 keywords
|
|
|
Results
Found 4 publication records. Showing 4 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
106 | Luca Becchetti, Stefano Leonardi 0001 |
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
multilevel feedback, randomized algorithms, Probabilistic analysis, flow time |
106 | Luca Becchetti, Stefano Leonardi 0001 |
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
89 | Bala Kalyanasundaram, Kirk Pruhs |
Minimizing Flow Time Nonclairvoyantly. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
flow time minimization, dynamically arriving jobs, unknown execution times, average response/flow time, classic CPU scheduling problem, time sharing operating systems, standard 3-field scheduling notation, nonclairvoyant version, randomized nonclairvoyant algorithm, RMLF, multi level feedback algorithm, deterministic nonclairvoyant algorithm, scheduling, minimisation, competitive ratio, Unix operating system, adaptive adversary |
53 | Bala Kalyanasundaram, Kirk Pruhs |
Minimizing flow time nonclairvoyantly. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
multilevel feedback, shortest elapsed time first, Scheduling, randomized algorithm, resource augmentation, flow time |
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|