Sciweavers

10106 search results - page 261 / 2022
» Algorithm Selection and Scheduling
Sort
View
165
Voted
KR
1989
Springer
15 years 10 months ago
Situated Control Rules
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Mark Drummond
194
Voted
IJFCS
2006
63views more  IJFCS 2006»
15 years 6 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
ISAAC
1994
Springer
80views Algorithms» more  ISAAC 1994»
15 years 10 months ago
Unifying Themes for Network Selection
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
HM
2007
Springer
118views Optimization» more  HM 2007»
16 years 23 days ago
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...
AAAI
2000
15 years 8 months ago
A Campus-Wide University Examination Timetabling Application
The authors of this paper were tasked to create an automated campus-wide timetabling system, for both course and examination timetable scheduling, for the National University of S...
Andrew Lim, Ang Juay Chin, Wee-Kit Ho, Wee-Chong O...