Titlebook: Evolutionary Computation in Combinatorial Optimization; 7th European Confere Carlos Cotta,Jano Hemert Conference proceedings 2007 Springer-

帶子

GEM

sleep-spindles

A New Local Search Algorithm for the DNA Fragment Assembly Problem, a problem to be solved in the early phases of the genome project and thus is very important since the other steps depend on its accuracy. This is an NP-hard combinatorial optimization problem which is growing in importance and complexity as more research centers become involved on sequencing new ge

高調(diào)

A Hybrid Immune-Based System for the Protein Folding Problem,m (PFP) in the 3D Hydrophobic-Polar model, which is a particular instance of the Combinatorial String Folding Problem in a cubic lattice. The proposed methodology aims at enhancing the Clonalg algorithm with a Fuzzy Aging Operator and Weak and Intensive Affinity Maturation. The aging operator uses a

exquisite

A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags,of the more well known Resource Investment Problem, which considers only time-independent costs, this problem includes both time-independent fixed costs and time-dependent variable renting costs for the resources. Consequently, in addition to projects where all resources are bought, we can deal with