1310 search results - page 94 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
167
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
130
click to vote
CEC
2005
IEEE
15 years 11 months ago
2005
IEEE
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. Howeve...
156
click to vote
PPL
2007
15 years 5 months ago
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
158
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
183
click to vote
APDC
1997
15 years 7 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...