Sciweavers

1095 search results - page 63 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
108
Voted
IPCO
1998
152views Optimization» more  IPCO 1998»
14 years 11 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
SPDP
1991
IEEE
15 years 1 months ago
A decentralized task scheduling algorithm and its performance modeling for computer networks
A dynamic taskschedulingalgorithm,that isstable,decentralized,and adaptivetonetwork topology,ispresented. Theproposedalgorithmisanextensionofnearestneighbor loadbalancingstrategyw...
Ishfaq Ahmad, Arif Ghafoor, Kishan G. Mehrotra
CCGRID
2002
IEEE
15 years 3 months ago
On Advantages of Grid Computing for Parallel Job Scheduling
This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on diff...
Carsten Ernemann, Volker Hamscher, Uwe Schwiegelsh...
93
Voted
HICSS
2005
IEEE
164views Biometrics» more  HICSS 2005»
15 years 3 months ago
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications
Association rule mining in real-time is of increasing thrust in many business applications. Applications such as e-commerce, recommender systems, supply-chain management and group...
Rajanish Dass, Ambuj Mahanti
75
Voted
KBSE
2009
IEEE
15 years 5 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller