Sciweavers

855 search results - page 96 / 171
» Embedded core testing using genetic algorithms
Sort
View
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 7 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 4 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
BMCBI
2006
113views more  BMCBI 2006»
15 years 3 months ago
QualitySNP: a pipeline for detecting single nucleotide polymorphisms and insertions/deletions in EST data from diploid and polyp
Background: Single nucleotide polymorphisms (SNPs) are important tools in studying complex genetic traits and genome evolution. Computational strategies for SNP discovery make use...
Jifeng Tang, Ben Vosman, Roeland E. Voorrips, C. G...
OOPSLA
2010
Springer
15 years 1 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
FPGA
2004
ACM
234views FPGA» more  FPGA 2004»
15 years 6 months ago
An embedded true random number generator for FPGAs
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
Paul Kohlbrenner, Kris Gaj