204 search results - page 12 / 41 » Information Operator Scheduling by Genetic Algorithms |
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
ENGL
2007
13 years 7 months ago
2007
—Instantaneous detection and diagnosis of various faults and break-downs in industrial processes is required to reduce production losses and damage to equipments. A solved knowle...
DMIN
2006
13 years 9 months ago
2006
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
ESIAT
2009
IEEE
13 years 5 months ago
2009
IEEE
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...