2754 search results - page 41 / 551 » Distributed Weighted Matching |
114
Voted
ICDCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
106
click to vote
ISAAC
1998
Springer
15 years 5 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...
106
Voted
DLOG
2009
14 years 10 months ago
2009
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
106
click to vote
IPSN
2009
Springer
15 years 7 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
101
Voted
DSRT
2009
IEEE
15 years 4 months ago
2009
IEEE
—Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing inter...