Sciweavers

17760 search results - page 254 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
SAC
2008
ACM
15 years 4 months ago
Adaptive importance sampling in general mixture classes
In this paper, we propose an adaptive algorithm that iteratively updates both the weights and component parameters of a mixture importance sampling density so as to optimise the p...
Olivier Cappé, Randal Douc, Arnaud Guillin,...
IDA
2010
Springer
15 years 3 months ago
GA-stacking: Evolutionary stacked generalization
Stacking is a widely used technique for combining classifiers and improving prediction accuracy. Early research in Stacking showed that selecting the right classifiers, their par...
Agapito Ledezma, Ricardo Aler, Araceli Sanch&iacut...
JSC
2010
96views more  JSC 2010»
15 years 3 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 10 months ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 6 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson