Sciweavers

12519 search results - page 422 / 2504
» Approximation Problems Categories
Sort
View
ICML
2010
IEEE
15 years 8 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
CORR
1999
Springer
115views Education» more  CORR 1999»
15 years 6 months ago
The Symbol Grounding Problem
: There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This pa...
Stevan Harnad
GECCO
2010
Springer
227views Optimization» more  GECCO 2010»
15 years 10 months ago
Benchmarking SPSA on BBOB-2010 noisy function testbed
This paper presents the result for Simultaneous Perturbation Stochastic Approximation (SPSA) on the BBOB 2010 noisy testbed. SPSA is a stochastic gradient approximation strategy w...
Steffen Finck, Hans-Georg Beyer
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
15 years 8 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...
ESWS
2009
Springer
16 years 1 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...