10988 search results - page 272 / 2198 » Algorithmic Folding Complexity |
132
click to vote
ALIFE
2008
15 years 4 months ago
2008
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
112
click to vote
BIOSYSTEMS
2007
15 years 4 months ago
2007
Noise and component failure is an increasingly difficult problem in modern electronic design. Bioinspired techniques is one approach that is applied in an effort to solve such is...
152
click to vote
ISNN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
110
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper addresses two key limitations of the unscented Kalman filter (UKF) when applied to the simultaneous localization and mapping (SLAM) problem: the cubic, in the numbe...