1310 search results - page 17 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
ESWA
2008
13 years 7 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
IICAI
2003
13 years 9 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...