Sciweavers

734 search results - page 104 / 147
» Multiprocess Time Queue
Sort
View
88
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 20 days ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
109
Voted
QRE
2010
129views more  QRE 2010»
14 years 11 months ago
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
Rajesh Ganesan, Poornima Balakrishna, Lance Sherry
MSS
1999
IEEE
150views Hardware» more  MSS 1999»
15 years 4 months ago
Performance Benchmark Results for Automated Tape Library High Retrieval Rate Applications - Digital Check Image Retrievals
Benchmark tests have been designed and conducted for the purpose of evaluating the use of automated tape libraries in on-line digital check image retrieval applications. This type...
John Gniewek, George Davidson, Bowen Caldwell
132
Voted
SIES
2009
IEEE
15 years 7 months ago
Programmable temporal isolation through variable-bandwidth servers
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...
Silviu S. Craciunas, Christoph M. Kirsch, Hannes P...
100
Voted
CCGRID
2007
IEEE
15 years 7 months ago
Reparallelization and Migration of OpenMP Programs
Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system ut...
Michael Klemm, Matthias Bezold, Stefan Gabriel, Ro...