Sciweavers

107 search results - page 11 / 22
» Finding Compact BDDs Using Genetic Programming
Sort
View
PLDI
1999
ACM
13 years 11 months ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus
BMCBI
2005
122views more  BMCBI 2005»
13 years 6 months ago
GenClust: A genetic algorithm for clustering gene expression data
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...
Vito Di Gesù, Raffaele Giancarlo, Giosu&egr...
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
13 years 12 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
CEC
2007
IEEE
13 years 10 months ago
A multi-layered solution for supporting isp traffic demand using genetic algorithm
This paper proposes a unique feedback governed multi layered architectural model to support ISP's traffic demands with multiple Quality of Service(QoS) constraints. The propos...
Gajaruban Kandavanam, Dmitri Botvich, Sasitharan B...
ICSE
2008
IEEE-ACM
14 years 7 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su