Sciweavers

4403 search results - page 57 / 881
» Galois Theory of Algorithms
Sort
View
IJCAI
2003
15 years 7 months ago
Monte Carlo Theory as an Explanation of Bagging and Boosting
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
Roberto Esposito, Lorenza Saitta
EC
1998
112views ECommerce» more  EC 1998»
15 years 5 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
MOC
2002
78views more  MOC 2002»
15 years 5 months ago
A geometric theory for preconditioned inverse iteration applied to a subspace
ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration, which is designated to determine a modest number of the smallest eigen...
Klaus Neymeyr
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 9 months ago
A computational theory of adaptive behavior based on an evolutionary reinforcement mechanism
Two mathematical and two computational theories from the field of human and animal learning are combined to produce a more general theory of adaptive behavior. The cornerstone of ...
J. J. McDowell, Paul L. Soto, Jesse Dallery, Saule...
CADE
2003
Springer
16 years 6 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon