120 search results - page 9 / 24 » Genetically designed heuristics for the bin packing problem |
164
click to vote
GECCO
2004
Springer
15 years 11 months 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...
146
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
196
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
160
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
140
click to vote
IJES
2006
15 years 6 months ago
2006
Embedded real-time systems must satisfy not only logical functional requirements but also para-functional properties such as timeliness, Quality of Service (QoS) and reliability. W...