Sciweavers

50 search results - page 8 / 10
» Maximum inner-product search using cone trees
Sort
View
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 9 months ago
Potential fitness for genetic programming
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
Krzysztof Krawiec, PrzemysBaw Polewski
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 2 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
BMCBI
2010
164views more  BMCBI 2010»
13 years 8 months ago
Pan-genome sequence analysis using Panseq: an online tool for the rapid analysis of core and accessory genomic regions
Background: The pan-genome of a bacterial species consists of a core and an accessory gene pool. The accessory genome is thought to be an important source of genetic variability i...
Chad Laing, Cody Buchanan, Eduardo N. Taboada, Yon...
ATAL
2010
Springer
13 years 9 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
CPAIOR
2010
Springer
14 years 1 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon