Sciweavers

19 search results - page 1 / 4
» Constraint quadratic approximation operator for treating equ...
Sort
View
CEC
2005
IEEE
13 years 11 months ago
Constraint quadratic approximation operator for treating equality constraints with genetic algorithms
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
Elizabeth F. Wanner, Frederico G. Guimarães...
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 5 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
ESWA
2011
230views Database» more  ESWA 2011»
13 years 17 days ago
Multi-objective genetic algorithms for scheduling of radiotherapy treatments for categorised cancer patients
This paper presents a multi-objective optimisation model and algorithms for scheduling of radiotherapy treatments for categorised cancer patients. The model is developed considerin...
Dobrila Petrovic, Mohammad Morshed, Sanja Petrovic
CVPR
2005
IEEE
13 years 11 months ago
Symmetric Stereo Matching for Occlusion Handling
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
Jian Sun, Yin Li, Sing Bing Kang
CP
1999
Springer
13 years 10 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz