Sciweavers

304 search results - page 14 / 61
» Exploiting problem structure in a genetic algorithm approach...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed
ICMLA
2009
13 years 5 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
INFSOF
2008
85views more  INFSOF 2008»
13 years 7 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
14 years 1 months ago
Variable discrimination of crossover versus mutation using parameterized modular structure
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
Rob Mills, Richard A. Watson