Sciweavers

1424 search results - page 100 / 285
» The Multi-radius Cover Problem
Sort
View
CEC
2010
IEEE
15 years 4 months ago
Defining locality in genetic programming to predict performance
Abstract-- A key indicator of problem difficulty in evolutionary computation problems is the landscape's locality, that is whether the genotype-phenotype mapping preserves nei...
Edgar Galván López, James McDermott,...
TSMC
2002
119views more  TSMC 2002»
15 years 2 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore

Book
422views
17 years 2 months ago
Intelligence: The Eye, the Brain and the Computer
"This book is intended to be an intellectual journey into the domain of human and machine intelligence". The book covers several topics such as intelligence, knowledge re...
M. A. Fischler, O. Firschein
TAMC
2009
Springer
15 years 9 months ago
Searching Trees: An Essay
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...
Henning Fernau, Daniel Raible
DNA
2005
Springer
144views Bioinformatics» more  DNA 2005»
15 years 8 months ago
Designing Nucleotide Sequences for Computation: A Survey of Constraints
We survey the biochemical constraints useful for the design of DNA code words for DNA computation. We define the DNA/RNA Code Constraint problem and cover biochemistry topics rel...
Jennifer A. Sager, Darko Stefanovic