873 search results - page 68 / 175 » Rates of convergence for Quicksort |
147
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
123
click to vote
ICDCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
149
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fty generations we measured bloat O(generations1:2;1:5). On two simple benchmarks w...
165
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
125
click to vote
FLAIRS
2000
15 years 7 months ago
2000
Wepropose a schemefor producingLatin hypercube samples that can enhanceany of the existing sampling algorithms in Bayesiannetworks. Wetest this scheme in combinationwith the likel...