Sciweavers

521 search results - page 76 / 105
» On Stable Matchings and Flows
Sort
View
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
15 years 11 months ago
Evaluating TOP-K Queries over Business Processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifica...
Daniel Deutch, Tova Milo
GLOBECOM
2009
IEEE
15 years 4 months ago
Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia,...
SIGCOMM
2010
ACM
14 years 10 months ago
Scalable flow-based networking with DIFANE
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...
Minlan Yu, Jennifer Rexford, Michael J. Freedman, ...
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
14 years 10 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
CN
2002
98views more  CN 2002»
14 years 9 months ago
Modeling random early detection in a differentiated services network
An analytical framework for modeling a network of Random Early Detection (RED) queues with mixed traffic types (e.g. TCP and UDP) is developed. Expressions for the steady state go...
Alhussein A. Abouzeid, Sumit Roy