Sciweavers

1725 search results - page 164 / 345
» Relaxed genetic programming
Sort
View
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 3 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 3 months ago
Evolving Consensus Sequence for Multiple Sequence Alignment with a Genetic Algorithm
In this paper we present an approach that evolves the consensus sequence [25] for multiple sequence alignment (MSA) with genetic algorithm (GA). We have developed an encoding schem...
Conrad Shyu, James A. Foster
ICTAI
2000
IEEE
15 years 2 months ago
Constrained genetic algorithms and their applications in nonlinear constrained optimization
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
Benjamin W. Wah, Yixin Chen
BMCBI
2007
108views more  BMCBI 2007»
14 years 10 months ago
Computer-aided identification of polymorphism sets diagnostic for groups of bacterial and viral genetic variants
Background: Single nucleotide polymorphisms (SNPs) and genes that exhibit presence/absence variation have provided informative marker sets for bacterial and viral genotyping. Iden...
Erin P. Price, John Inman-Bamber, Venugopal Thiruv...
CORR
2006
Springer
105views Education» more  CORR 2006»
14 years 10 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman