65 search results - page 11 / 13 » Two Metaheuristics for Multiobjective Stochastic Combinatori... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
PE
2011
Springer
13 years 2 months ago
2011
Springer
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
CEC
2011
IEEE
12 years 7 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
GECCO
2010
Springer
14 years 8 days ago
2010
Springer
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
EUROCAST
2007
Springer
13 years 11 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...