56 search results - page 9 / 12 » A Note on Distributed Stable Matching |
112
click to vote
ICPP
1992
IEEE
15 years 3 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
We consider a problem central in aerial visual surveillance applications { detection and tracking of small, independently moving objects in long and noisy video sequences. We dire...
ALGORITHMICA
2005
14 years 11 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
109
click to vote
ATAL
2010
Springer
15 years 25 days ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
131
click to vote
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...