Sciweavers

124 search results - page 23 / 25
» Basis function construction for hierarchical reinforcement l...
Sort
View
IJON
2007
184views more  IJON 2007»
13 years 7 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
ML
2008
ACM
13 years 7 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
TEC
2008
139views more  TEC 2008»
13 years 7 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane
TEC
2010
191views more  TEC 2010»
13 years 2 months ago
Particle Swarm Optimization Aided Orthogonal Forward Regression for Unified Data Modeling
We propose a unified data modeling approach that is equally applicable to supervised regression and classification applications, as well as to unsupervised probability density func...
Sheng Chen, Xia Hong, Chris J. Harris
JAIR
2008
103views more  JAIR 2008»
13 years 7 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...