Sciweavers

2214 search results - page 188 / 443
» complexity 2004
Sort
View
122
Voted
FSTTCS
2004
Springer
15 years 8 months ago
Genome Halving Problem Revisited
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Max A. Alekseyev, Pavel A. Pevzner
FSTTCS
2004
Springer
15 years 8 months ago
Visibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
Christof Löding, P. Madhusudan, Olivier Serre
105
Voted
GCC
2004
Springer
15 years 8 months ago
EEMAS: An Enabling Environment for Multidisciplinary Application Simulations
Abstract. EEMAS environment is a problem-solving environment for multidisciplinary application simulations. Within the EEMAS, there are four categories of modules involved, namely ...
Lijun Xie, Yao Zheng, Jifa Zhang, Xin Huang, Zheng...
124
Voted
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 8 months ago
Training Neural Networks with GA Hybrid Algorithms
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
Enrique Alba, J. Francisco Chicano
116
Voted
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
15 years 8 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...