Sciweavers

377 search results - page 6 / 76
» A Value Theory of Meta-Learning Algorithms
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 9 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
ISCI
2008
88views more  ISCI 2008»
14 years 9 months ago
Greedy regression ensemble selection: Theory and an application to water quality prediction
This paper studies the greedy ensemble selection family of algorithms for ensembles of regression models. These algorithms search for the globally best subset of regresmaking loca...
Ioannis Partalas, Grigorios Tsoumakas, Evaggelos V...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
69
Voted
MOC
2000
124views more  MOC 2000»
14 years 9 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
72
Voted
MOC
2002
132views more  MOC 2002»
14 years 9 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden