11231 search results - page 1982 / 2247 » Digging for Data Structures |
120
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
149
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
144
Voted
AICCSA
2001
IEEE
15 years 7 months ago
2001
IEEE
- This paper presents an environment for development of distributed applications. It consists basically of adding to language Java a library of methods to manipulate shared objects...
133
Voted
EDBT
2000
ACM
15 years 7 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
110
Voted
IFIP
2000
Springer
15 years 7 months ago
2000
Springer
The academic field of information systems has developed because organizations use a specialized body of knowledge about information and communications systems. Teaching and resear...