224 search results - page 35 / 45 » Bounding Learning Time in XCS |
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
135
click to vote
ICML
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
AAAI
2007
15 years 1 days ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
EWRL
2008
14 years 11 months ago
2008
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...