Sciweavers

4781 search results - page 406 / 957
» Online algorithms for network design
Sort
View
207
Voted
APNOMS
2006
Springer
15 years 11 months ago
GISness System for Fast TSP Solving and Supporting Decision Making
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...
Iwona Pozniak-Koszalka, Ireneusz Kulaga, Leszek Ko...
229
Voted
TRIDENTCOM
2005
IEEE
16 years 1 months ago
A Geography-Aware Scalable Community Wireless Network Test Bed
Wireless mesh networks have increasingly become an object of interest in recent years as a strong alternative to purely wired infrastructure networks and purely mobile wireless ne...
Bow-Nan Cheng, Shivkumar Kalyanaraman, Max Klein
189
Voted
MOBIHOC
2009
ACM
16 years 8 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
227
Voted
IPPS
1998
IEEE
15 years 12 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
221
Voted
CCR
2006
115views more  CCR 2006»
15 years 7 months ago
Network coding: an instant primer
Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are...
Christina Fragouli, Jean-Yves Le Boudec, Jörg...