Sciweavers

3838 search results - page 181 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
CCE
2006
15 years 4 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
GECCO
2006
Springer
226views Optimization» more  GECCO 2006»
15 years 7 months ago
Segmentation of medical images using a genetic algorithm
Segmentation of medical images is challenging due to poor image contrast and artifacts that result in missing or diffuse organ/tissue boundaries. Consequently, this task involves ...
Payel Ghosh, Melanie Mitchell
DEXAW
2008
IEEE
204views Database» more  DEXAW 2008»
15 years 10 months ago
Particle Swarm Optimization Using Adaptive Mutation
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
Millie Pant, Radha Thangaraj, Ajith Abraham
ESCIENCE
2006
IEEE
15 years 10 months ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 7 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...