373 search results - page 28 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
120
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
117
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
104
click to vote
WCE
2007
15 years 4 months ago
2007
—The research efforts of the DECIDE Research Group have resulted in a decision tool capable of handling imprecise information in complex decision situations. Some of the research...
123
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
164
click to vote
ECML
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...