Sciweavers

16188 search results - page 453 / 3238
» The Optimal PAC Algorithm
Sort
View
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
16 years 1 months ago
Why one must use reweighting in estimation of distribution algorithms
We study the update of the distribution in Estimation of Distribution Algorithms, and show that a simple modification leads to unbiased estimates of the optimum. The simple modiļ...
Fabien Teytaud, Olivier Teytaud
EVOW
2005
Springer
16 years 12 days ago
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
Olfa Sammoud, Christine Solnon, Khaled Ghéd...
ISMIR
2005
Springer
120views Music» more  ISMIR 2005»
16 years 12 days ago
Melodic Similarity Algorithms -- Using Similarity Ratings for Development and Early Evaluation
This paper focuses on gathering similarity ratings for use in the construction, optimization and evaluation of melodic similarity algorithms. The approach involves conducting list...
Margaret Cahill, Donncha Ó. Maidín
GECCO
2004
Springer
16 years 8 days ago
A Caching Genetic Algorithm for Spectral Breakpoint Matching
Abstract. Two methods were evaluated for performing spectral breakpoint matching: a multi-level pruned exhaustive search and a genetic algorithm. The GA found matches about as good...
Jonathan Mohr, Xiaobo Li
ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
15 years 11 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang