Sciweavers

2930 search results - page 296 / 586
» The optimal sequence compression
Sort
View
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 5 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
ICC
2009
IEEE
135views Communications» more  ICC 2009»
16 years 22 days ago
Block Detection of Multiple Symbol DPSK in a Statistically Unknown Time-Varying Channel
—We present a detection scheme for multiple-symbol DPSK for use in a statistically unknown time-varying channel. The scheme relies on a parametric representation of the timevaryi...
Nathan Ricklin, James R. Zeidler
EUROGP
2009
Springer
138views Optimization» more  EUROGP 2009»
16 years 17 days ago
Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program. This is do...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
RECOMB
1997
Springer
15 years 10 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
COR
2006
86views more  COR 2006»
15 years 6 months ago
Minimizing the earliness-tardiness costs on a single machine
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Jakub Bauman, Joanna Józefowska