Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...
Aaron Gabow, Sonia M. Leach, William A. Baumgartne...
When applied to optimization problems, Cooperative Coevolutionary Algorithms (CCEA) have been observed to exhibit a behavior called relative overgeneralization. Roughly, they tend...
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...