Sciweavers

2988 search results - page 41 / 598
» Experiments with a New Boosting Algorithm
Sort
View
ECAI
2006
Springer
15 years 1 months ago
A Real Generalization of Discrete AdaBoost
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...
Richard Nock, Frank Nielsen
MICCAI
2008
Springer
15 years 11 months ago
Cortical Surface Thickness as a Classifier: Boosting for Autism Classification
We study the problem of classifying an autistic group from controls using structural image data alone, a task that requires a clinical interview with a psychologist. Because of the...
Vikas Singh, Lopamudra Mukherjee, Moo K. Chung
CP
2008
Springer
14 years 11 months ago
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...
Gilles Audemard, Laurent Simon
AAMAS
2005
Springer
15 years 3 months ago
Advice-Exchange Between Evolutionary Algorithms and Reinforcement Learning Agents: Experiments in the Pursuit Domain
This research aims at studying the effects of exchanging information during the learning process in Multiagent Systems. The concept of advice-exchange, introduced in (Nunes and Ol...
Luís Nunes, Eugénio C. Oliveira
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 4 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh