4377 search results - page 585 / 876 » Mass problems and randomness |
198
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
162
click to vote
TEC
2008
15 years 6 months ago
2008
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
196
click to vote
JCSS
2007
15 years 6 months ago
2007
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
165
click to vote
TPDS
2008
15 years 6 months ago
2008
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
163
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...