Sciweavers

290 search results - page 26 / 58
» Network as a Computer: Ranking Paths to Find Flows
Sort
View
ICNP
2005
IEEE
15 years 3 months ago
Simple Robotic Routing in Ad Hoc Networks
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
Daejoong Kim, Nicholas F. Maxemchuk
CGO
2003
IEEE
15 years 1 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
CSE
2009
IEEE
14 years 7 months ago
Size Matters: Variation in Personal Network Size, Personality and Effect on Information Transmission
In the last decade, there has been a massive increase in network research across both the social and physical sciences. In Physics and Mathematics, there have been extensive work o...
Yu-En Lu, Sam Roberts, Pietro Liò, Robin Du...
CONEXT
2008
ACM
14 years 11 months ago
Exploiting multi-flow diversity for mitigating intra-flow interference in wireless mesh networks
We consider the problem of improving network capacity in wireless mesh networks from the angle of multi-flow diversity. As consecutive packets on a multihop path can interfere wit...
Taewoon Kim, Hyuk Lim, Chaegwon Lim
JAL
2006
101views more  JAL 2006»
14 years 10 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...