Sciweavers

74 search results - page 4 / 15
» Random Debaters and the Hardness of Approximating Stochastic...
Sort
View
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 1 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
74
Voted
MP
2002
93views more  MP 2002»
14 years 9 months ago
Conditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
Alexander Shapiro, Tito Homem-de-Mello, Joocheol K...
SIAMCO
2002
71views more  SIAMCO 2002»
14 years 9 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
WSC
2004
14 years 10 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
EOR
2006
103views more  EOR 2006»
14 years 9 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...