Sciweavers

76 search results - page 2 / 16
» Searching for Opportunities of Refactoring Sequences: Reduci...
Sort
View
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
13 years 12 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
SOMET
2007
13 years 8 months ago
Automated Design Improvement by Example
The high cost of software maintenance could potentially be reduced by automatically improving the design of object-oriented programs without altering their behaviour. We have const...
Mark O'Keeffe, Mel Ó Cinnéide
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
WCNC
2008
IEEE
14 years 2 months ago
Two-Stage Code Acquisition Employing Search Space Reduction and Iterative Detection in the DS-UWB Downlink
— In this paper we propose and investigate an iterative code acquisition scheme assisted by both search space reduction and iterative Massage Passing (MP), which was designed for...
Seung Hwan Won, Lajos Hanzo