832 search results - page 9 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
48
Voted
COR
1999
14 years 9 months ago
1999
OTM
2010
Springer
14 years 7 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
JCM
2007
14 years 9 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
SIAMDM
2010
14 years 4 months ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...