1310 search results - page 101 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
227
click to vote
EOR
2010
15 years 4 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...
153
click to vote
ICGA
1997
15 years 8 months ago
1997
A methodology is described for synthesizing signal processing networks, which are used to solve a low-cost medical signal processing problem. The approach makes use of genetic alg...
175
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
218
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
160
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...