5595 search results - page 102 / 1119 » Approximation Algorithms for Clustering Problems |
129
click to vote
AUSAI
2004
Springer
15 years 10 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
136
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
162
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
118
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
144
click to vote
AFRIGRAPH
2003
ACM
15 years 8 months ago
2003
ACM
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...