Sciweavers

2412 search results - page 8 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
COLT
2010
Springer
13 years 7 months ago
The Convergence Rate of AdaBoost
Abstract. We pose the problem of determining the rate of convergence at which AdaBoost minimizes exponential loss. Boosting is the problem of combining many "weak," high-...
Robert E. Schapire
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 1 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
JCIT
2008
99views more  JCIT 2008»
13 years 9 months ago
Iterative Operator-Splitting Methods for Stiff Problems in Complex Applications
In this paper we deal with the Landau-LifshitzGilbert equation which describes dynamics of ferromagnetism. Based on the strong nonlinearities a stabilised discretisation method is...
Jürgen Geiser
PODC
2010
ACM
14 years 1 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
IJCAI
1997
13 years 11 months ago
Computational Complexity of Multi-way, Dataflow Constraint Problems
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
Gilles Trombettoni, Bertrand Neveu