1071 search results - page 112 / 215 » Theories of Automatic Structures and Their Complexity |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
NN
2006
Springer
13 years 8 months ago
2006
Springer
Identification of the short DNA sequence motifs that serve as binding targets for transcription factors is an important challenge in bioinformatics. Unsupervised techniques from t...
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
This paper presents a control structure for general purpose image understanding that addresses both the high level of uncertainty in local hypotheses and the computational complex...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...