5675 search results - page 878 / 1135 » Exploiting Chaos for Computation |
196
click to vote
ICANN
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
170
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
This paper introduces a new measurement, robustness, to measure the quality of machine-discovered knowledge from real-world databases that change over time. A piece of knowledge i...
192
click to vote
ECML
1991
Springer
15 years 10 months ago
1991
Springer
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
175
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...
180
click to vote
AIPS
2010
15 years 9 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...