302 search results - page 41 / 61 » Efficient Algorithms for the Longest Path Problem |
164
Voted
JPDC
2006
15 years 3 months ago
2006
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
128
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
119
click to vote
ANOR
2010
15 years 3 months ago
2010
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
129
click to vote
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
112
click to vote
TON
2008
15 years 3 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...