Sciweavers

5140 search results - page 167 / 1028
» Complex Network of Earthquakes
Sort
View
IPL
2010
112views more  IPL 2010»
15 years 2 months ago
The cost of probabilistic agreement in oblivious robot networks
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...
Julien Clement, Xavier Défago, Maria Gradin...
COMCOM
2010
118views more  COMCOM 2010»
15 years 1 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
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...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
113
Voted
MOBIHOC
2009
ACM
16 years 5 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
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...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
IPPS
1998
IEEE
15 years 8 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani