Sciweavers

1071 search results - page 65 / 215
» An Experimental Study of Benchmarking Functions for Genetic ...
Sort
View
DAC
2003
ACM
14 years 10 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
GECCO
2005
Springer
157views Optimization» more  GECCO 2005»
14 years 2 months ago
Simple addition of ranking method for constrained optimization in evolutionary algorithms
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
Pei Yee Ho, Kazuyuki Shimizu
SOCO
2010
Springer
13 years 3 months ago
Designing multilayer perceptrons using a Guided Saw-tooth Evolutionary Programming Algorithm
In this paper, a diversity generating mechanism is proposed for an Evolutionary Programming (EP) algorithm that determines the basic structure of Multilayer Perceptron classifiers ...
Pedro Antonio Gutiérrez, César Herv&...
EVOW
2006
Springer
14 years 19 days ago
The Core Concept for the Multidimensional Knapsack Problem
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
Jakob Puchinger, Günther R. Raidl, Ulrich Pfe...
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
14 years 2 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida