3875 search results - page 519 / 775 » Approximation algorithms for the 0-extension problem |
201
click to vote
JAIR
2006
15 years 6 months ago
2006
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
174
click to vote
JSAC
2006
15 years 6 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
164
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
172
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
182
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...