Sciweavers

1628 search results - page 16 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
BMCBI
2011
13 years 3 days ago
Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...
CCCG
2007
13 years 10 months ago
Optimal Point Set Partitioning using Rigid Motion Star Placement
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
Prosenjit Bose, Jason Morrison
DAGSTUHL
2006
13 years 10 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
ICS
2009
Tsinghua U.
14 years 1 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
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...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
EMO
2001
Springer
109views Optimization» more  EMO 2001»
14 years 1 months ago
Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
Tadahiko Murata, Hisao Ishibuchi, Mitsuo Gen