485 search results - page 40 / 97 » Iterative Bounding LAO |
107
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
110
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
129
click to vote
SAC
2004
ACM
15 years 9 months ago
2004
ACM
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
127
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper presents a guaranteed method for the parameter estimation of nonlinear models in a bounded-error context. This method is based on functions which consists of the differ...
122
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...