Sciweavers

467 search results - page 66 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
CLUSTER
2002
IEEE
13 years 7 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
PDP
2005
IEEE
14 years 29 days ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
WSC
2004
13 years 8 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount