Sciweavers

1182 search results - page 37 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 8 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
NIPS
2008
15 years 3 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
102
Voted
RSA
2006
96views more  RSA 2006»
15 years 1 months ago
Concentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
Andreas Maurer
114
Voted
WSCG
2004
142views more  WSCG 2004»
15 years 3 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
AUTOMATICA
2008
82views more  AUTOMATICA 2008»
15 years 2 months ago
Iterative minimization of H2 control performance criteria
Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance crit...
Alexandre S. Bazanella, Michel Gevers, Ljubisa Mis...