Sciweavers

358 search results - page 5 / 72
» A Computational Study of Routing Algorithms for Realistic Tr...
Sort
View
AMC
2004
79views more  AMC 2004»
13 years 8 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
MOBIHOC
2010
ACM
13 years 6 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
PE
2006
Springer
158views Optimization» more  PE 2006»
13 years 8 months ago
Performance evaluation of multiple-rate mobile ad hoc networks
Existing wireless networks usually provide multiple data transmission rates. This paper presents a simulation study on the performance of multiple-rate mobile ad hoc networks (MAN...
Gang Ding, Xiaoxin Wu, Bharat K. Bhargava
WSC
2008
13 years 10 months ago
Simulation-based optimization of a complex mail transportation network
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Martin And...
PEWASUN
2004
ACM
14 years 1 months ago
Multipath routing and multiple description coding in ad-hoc networks: a simulation study
The nature of ad hoc networks makes it a challenge to offer connections with an assured quality. In order to improve the performance of the network, multipath routing in combinati...
Irene Fernández Díaz, Dick H. J. Epe...