Sciweavers

13414 search results - page 127 / 2683
» The distributed boosting algorithm
Sort
View
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
15 years 8 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
15 years 7 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
107
Voted
COLING
2010
14 years 9 months ago
The True Score of Statistical Paraphrase Generation
This article delves into the scoring function of the statistical paraphrase generation model. It presents an algorithm for exact computation and two applicative experiments. The f...
Jonathan Chevelu, Ghislain Putois, Yves Lepage
117
Voted
CVPR
2007
IEEE
16 years 4 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
187
Voted
ECAI
2008
Springer
15 years 4 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo