Sciweavers

390 search results - page 13 / 78
» When is an estimation of distribution algorithm better than ...
Sort
View
PPSN
2004
Springer
14 years 21 days ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
FSKD
2007
Springer
98views Fuzzy Logic» more  FSKD 2007»
14 years 1 months ago
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
Qing Wang, Chuan-hua Zhou, Jiankui Guo
EH
2003
IEEE
100views Hardware» more  EH 2003»
14 years 20 days ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
14 years 1 months ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
NIPS
2008
13 years 8 months ago
An Efficient Sequential Monte Carlo Algorithm for Coalescent Clustering
We propose an efficient sequential Monte Carlo inference scheme for the recently proposed coalescent clustering model [1]. Our algorithm has a quadratic runtime while those in [1]...
Dilan Görür, Yee Whye Teh