Sciweavers

2569 search results - page 275 / 514
» Approximate Objects and Approximate Theories
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 7 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
ICML
2010
IEEE
15 years 7 months ago
Convergence of Least Squares Temporal Difference Methods Under General Conditions
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
Huizhen Yu
APLAS
2010
ACM
15 years 6 months ago
Model Independent Order Relations for Processes
Semantic preorders between processes are usually applied in practice to model approximation or implementation relationships. For interactive models these preorders depend crucially...
Chaodong He
ADCM
2007
59views more  ADCM 2007»
15 years 6 months ago
Gabor frames by sampling and periodization
By sampling the window of a Gabor frame for L2 (R) belonging to Feichtinger’s algebra, S0(R), one obtains a Gabor frame for l2 (Z). In this article we present a survey of results...
Peter L. Søndergaard
ANOR
2006
64views more  ANOR 2006»
15 years 6 months ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz