Sciweavers

1768 search results - page 228 / 354
» Optimal routing in Chord
Sort
View
IJWIN
2007
68views more  IJWIN 2007»
15 years 1 months ago
Density-Independent, Scalable Search in Ad Hoc Networks
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
Zygmunt J. Haas, Rimon Barr
COMCOM
1999
87views more  COMCOM 1999»
15 years 1 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang
NETWORKS
2007
15 years 1 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
INFOCOM
2010
IEEE
15 years 15 hour ago
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efï¬...
Fragkiskos Papadopoulos, Dmitri V. Krioukov, Mari&...
IFIP12
2009
14 years 11 months ago
Revealing Paths of Relevant Information in Web Graphs
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
Georgios Kouzas, Vassilis Kolias, Ioannis Anagnost...