521 search results - page 56 / 105 » On Stable Matchings and Flows |
115
click to vote
KI
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. In this paper, we present a system for simultaneous localization and map building of a mobile robot, based on an attentional landmark detector. A biologically motivated a...
109
click to vote
ICALP
2009
Springer
16 years 4 days ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
ICPR
2000
IEEE
15 years 3 months ago
2000
IEEE
Abstract. An accurate analysis of a large dynamic system like our oceans requires spatially fine and temporally matched data collection methods. Current methods to estimate fish st...
CN
2002
14 years 11 months ago
2002
Abstract-- While traffic volume of real-time applications is rapidly increasing, current routers do not guarantee minimum QoS values of fairness and they drop packets in random fas...