170 search results - page 14 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
121
click to vote
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
134
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
136
Voted
CSSE
2002
IEEE
2002
IEEE
Characteristics of assured service and an alternative RIO scheme in differentiated services networks
15 years 2 months ago
Assured Service, a service model of Internet Differentiated Services (DiffServ) architecture, is not so well accommodated by the current Internet environment. This is because the I...
116
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
114
Voted
DIS
2007
Springer
15 years 9 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...