Sciweavers

4047 search results - page 174 / 810
» The Discrete Basis Problem
Sort
View
ICAISC
2004
Springer
15 years 6 months ago
Optimization of Centers' Positions for RBF Nets with Generalized Kernels
The problem of locating centers for radial basis functions in neural networks is discussed. The proposed approach allows us to apply the results from the theory of optimum experime...
Ewaryst Rafajlowicz, Miroslaw Pawlak
ARITH
2007
IEEE
15 years 5 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
CPAIOR
2009
Springer
15 years 7 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 7 months ago
Real-coded ECGA for economic dispatch
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
Chao-Hong Chen, Ying-Ping Chen
CORR
2012
Springer
235views Education» more  CORR 2012»
13 years 9 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli