Sciweavers

7522 search results - page 86 / 1505
» Spacing memetic algorithms
Sort
View
108
Voted
ICML
2003
IEEE
15 years 5 months ago
Evolutionary MCMC Sampling and Optimization in Discrete Spaces
The links between genetic algorithms and population-based Markov Chain Monte Carlo (MCMC) methods are explored. Genetic algorithms (GAs) are well-known for their capability to opt...
Malcolm J. A. Strens
112
Voted
PPSN
2000
Springer
15 years 4 months ago
Competitive Segmentation: A Struggle for Image Space
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
Cor J. Veenman, Marcel J. T. Reinders, Eric Backer
KDD
1995
ACM
133views Data Mining» more  KDD 1995»
15 years 4 months ago
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...
Ron Kohavi, Dan Sommerfield
CP
2008
Springer
15 years 2 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
98
Voted
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
15 years 2 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer