Sciweavers

697 search results - page 10 / 140
» Improving EAs for Sequencing Problems
Sort
View
INFSOF
2006
103views more  INFSOF 2006»
13 years 7 months ago
Improving test quality using robust unique input/output circuit sequences (UIOCs)
In finite state machine (FSM) based testing, the problem of fault masking in the unique input/output (UIO) sequence may degrade the test performance of the UIO based methods. This...
Qiang Guo, Robert M. Hierons, Mark Harman, Karnig ...
IPL
2006
67views more  IPL 2006»
13 years 7 months ago
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
Peter Damaschke
CEC
2005
IEEE
14 years 1 months ago
Ecology-inspired evolutionary algorithm using feasibility-based grouping for constrained optimization
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...
Ming Yuchi, Jong-Hwan Kim
ACL
2006
13 years 9 months ago
Semi-Supervised Conditional Random Fields for Improved Sequence Segmentation and Labeling
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
Feng Jiao, Shaojun Wang, Chi-Hoon Lee, Russell Gre...
SETA
2004
Springer
79views Mathematics» more  SETA 2004»
14 years 1 months ago
A Survey of the Merit Factor Problem for Binary Sequences
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
Jonathan Jedwab