33 search results - page 4 / 7 » From Recursion to Iteration: What are the Optimizations |
SC
2009
ACM
14 years 2 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
JGS
2010
13 years 2 months ago
2010
Despite the fact that it provides a potentially useful analytical tool, allowing for the joint modeling of dynamic interdependencies within a group of connected areas, until latel...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
The problem of how a teacher and a learner can cooperate in the process of learning concepts from examples in order to minimize the required sample size without “coding tricksâ€...
CSB
2004
IEEE
13 years 11 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...