2173 search results - page 176 / 435 » Modelling of Complex Supply Networks |
113
Voted
IPL
2010
15 years 2 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
123
Voted
COMCOM
2010
15 years 1 months ago
2010
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
161
Voted
SIGCOMM
2012
ACM
13 years 6 months ago
2012
ACM
As live streaming networks grow in scale and complexity, they are becoming increasingly difficult to evaluate. Existing evaluation methods including lab/testbed testing, simulati...
115
Voted
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Accurately modeling and predicting performance for largescale applications becomes increasingly difficult as system complexity scales dramatically. Analytic predictive mo...
101
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...