Sciweavers

712 search results - page 29 / 143
» The Complexity of Constructing Evolutionary Trees Using Expe...
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
GECCO
2003
Springer
15 years 3 months ago
The State Problem for Evolutionary Testing
Abstract. This paper shows how the presence of states in test objects can hinder or render impossible the search for test data using evolutionary testing. Additional guidance is re...
Phil McMinn, Mike Holcombe
100
Voted
ERCIMDL
2006
Springer
174views Education» more  ERCIMDL 2006»
15 years 3 days ago
Using MILOS to Build a Multimedia Digital Library Application: The PhotoBook Experience
Abstract. The digital library field is recently broadening its scope of applicability and it is also continuously adapting to the frequent changes occurring in the internet society...
Giuseppe Amato, Paolo Bolettieri, Franca Debole, F...
95
Voted
CG
2008
Springer
14 years 10 months ago
Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
Ingo Wald, Thiago Ize, Steven G. Parker
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
15 years 3 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai