Sciweavers

3038 search results - page 67 / 608
» High-Speed Function Approximation
Sort
View
113
Voted
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
15 years 6 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
CORR
2010
Springer
84views Education» more  CORR 2010»
15 years 2 months ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
SIROCCO
2008
15 years 3 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
113
Voted
ICIP
2007
IEEE
16 years 4 months ago
Hierarchical Tensor Approximation of Multidimensional Images
Visual data comprises of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop an adaptive data approximation technique based on a hie...
Qing Wu, Tian Xia, Yizhou Yu
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 2 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná