1480 search results - page 96 / 296 » Distributed algorithms for weighted problems in sparse graph... |
106
click to vote
ISAAC
1998
Springer
15 years 4 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
152
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
129
click to vote
ENTCS
2007
15 years 5 days ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
106
Voted
MICCAI
2010
Springer
14 years 11 months ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
132
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
A new approach based on Estimation Distribution Algorithms for constrained multiobjective shape optimization is proposed in this article. Pareto dominance and feasibility rules ar...