Sciweavers

32 search results - page 5 / 7
» Memory-Efficient Symbolic Heuristic Search
Sort
View
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 4 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
CAV
2000
Springer
89views Hardware» more  CAV 2000»
14 years 2 months ago
Tuning SAT Checkers for Bounded Model Checking
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
Ofer Strichman
ICSE
2003
IEEE-ACM
14 years 10 months ago
Constructing Test Suites for Interaction Testing
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...
CP
2003
Springer
14 years 3 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
ISMIR
2004
Springer
138views Music» more  ISMIR 2004»
14 years 3 months ago
MusicBLAST - Gapped Sequence Alignment for MIR
We propose an algorithm, MusicBLAST, for approximate pattern search/matching on symbolic musical data. MusicBLAST is based on the BLAST algorithm, one of the most commonly used al...
Jürgen Kilian, Holger H. Hoos