Sciweavers

218 search results - page 41 / 44
» Quantum-inspired evolutionary algorithm for a class of combi...
Sort
View
COMPGEOM
2009
ACM
14 years 1 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
GECCO
2010
Springer
200views Optimization» more  GECCO 2010»
14 years 7 days ago
Multivariate multi-model approach for globally multimodal problems
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
Chung-Yao Chuang, Wen-Lian Hsu
UAI
1997
13 years 8 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 4 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
GECCO
2004
Springer
14 years 25 days ago
On Multi-class Classification by Way of Niching
In recent literature, the niche enabling effects of crowding and the sharing algorithms have been systematically investigated in the context of Genetic Algorithms and are now estab...
Andrew R. McIntyre, Malcolm I. Heywood