204 search results - page 17 / 41 » Information Operator Scheduling by Genetic Algorithms |
180
Voted
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
176
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
208
click to vote
EOR
2010
15 years 3 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
195
Voted
CISS
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
191
click to vote
ITRE
2005
IEEE
16 years 20 hour ago
2005
IEEE
A Bayesian network model is a popular technique for data mining due to its intuitive interpretation. This paper presents a semantic genetic algorithm (SGA) to learn a complete qual...