165 search results - page 19 / 33 » A genetic algorithm for privacy preserving combinatorial opt... |
GECCO
2005
Springer
14 years 26 days ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...
GECCO
2010
Springer
14 years 6 days ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...