439 search results - page 8 / 88 » Genetic Algorithms for the Multiple Container Packing Proble... |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
COR
2006
13 years 7 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
ICNSC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper presents an approach to the multiple sequence alignment (MSA) problem by applying genetic algorithms with a reserve selection mechanism. MSA is one of the most funda...