241 search results - page 7 / 49 » Constraint Handling in Genetic Algorithms: The Set Partition... |
APPROX
2004
Springer
14 years 28 days ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
PPSN
1998
Springer
13 years 11 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
ICS
2009
Tsinghua U.
14 years 4 days ago
2009
Tsinghua U.
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
EVOW
2005
Springer
14 years 1 months ago
2005
Springer
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
Finding a good wavelet for a particular application and type of input data is a difficult problem. Traditional methods of wavelet deus on abstract properties of the wavelet that ca...