Sciweavers

1792 search results - page 231 / 359
» Improved scheduling in rings
Sort
View
IPPS
1999
IEEE
15 years 3 months ago
Communication-Intensive Parallel Applications and Non-dedicated Clusters of Workstations
Time-sharing operating systems may delay application processing of incoming messages because other processes are scheduled when the messages arrive. In this paper, we present a sim...
Kritchalach Thitikamol, Peter J. Keleher
EVOW
2000
Springer
15 years 2 months ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
FLAIRS
2008
15 years 1 months ago
Reformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
Roman Barták, Daniel Toropila
ACE
2003
110views Education» more  ACE 2003»
15 years 20 days ago
Programming students need instant feedback!
This paper describes the work that has been undertaken to improve the quantity and quality of feedback given to students studying introductory Java programming. An online submissi...
Anne Venables, Liz Haywood
CCE
2006
14 years 11 months ago
Air separation control technology
Achieving high performance process control (HPPC) requires that the control system operate the plant at optimal efficiency over the full range of steady state and dynamic conditio...
David R. Vinson