1095 search results - page 106 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
IPM
2008
14 years 10 months ago
2008
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
COLING
2008
14 years 11 months ago
2008
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
JSSPP
2005
Springer
15 years 3 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
104
click to vote
IOR
2010
14 years 8 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...