5329 search results - page 189 / 1066 » The Weighted Majority Algorithm |
172
click to vote
CEC
2008
IEEE
16 years 29 days ago
2008
IEEE
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
162
click to vote
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
177
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
102
click to vote
COCO
1992
Springer
15 years 10 months ago
1992
Springer
We give a novel characterization of W[1], the most important fixed-parameter intractability class in the W-hierarchy, using Boolean circuits that consist solely of majority gates. ...
150
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...