Sciweavers

3049 search results - page 101 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CIA
2006
Springer
15 years 8 months ago
Learning to Negotiate Optimally in Non-stationary Environments
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
Vidya Narayanan, Nicholas R. Jennings
CEC
2009
IEEE
15 years 9 months ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
AEI
2005
99views more  AEI 2005»
15 years 4 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
EMO
2001
Springer
209views Optimization» more  EMO 2001»
15 years 9 months ago
Comparison of Evolutionary and Deterministic Multiobjective Algorithms for Dose Optimization in Brachytherapy
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
Natasa Milickovic, Michael Lahanas, Dimos Baltas, ...
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 8 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace