Results 1  10
of
87,238
PointofFailure Swap Rerouting: Computing The Optimal Swaps Distributively
"... We consider the problem of computing the optimal swap edges of a shortestpath tree. This problem arises in designing systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message wi ..."
Abstract
 Add to MetaCart
We consider the problem of computing the optimal swap edges of a shortestpath tree. This problem arises in designing systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
EFFICIENT PROTOCOLS FOR COMPUTING THE OPTIMAL SWAP EDGES OF A SHORTEST PATH TREE
"... Abstract We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed li ..."
Abstract
 Add to MetaCart
Abstract We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed
Efficient protocols for computing optimal swap edges
 In Proc. of 3rd IFIP International Conference on Theoretical Computer Science (TCS
"... Abstract We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed lin ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract We consider the problem of computing the optimal swap edges of a shortestpath tree. This theoretical problem arises in practice in systems that offer pointoffailure shortestpath rerouting service in presence of a single link failure: if the shortest path is not affected by the failed
On Variants of ShortestPath Betweenness Centrality and their Generic Computation
 SOCIAL NETWORKS
, 2008
"... Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of ..."
Abstract

Cited by 75 (1 self)
 Add to MetaCart
Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
DecisionTheoretic Planning: Structural Assumptions and Computational Leverage
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1999
"... Planning under uncertainty is a central problem in the study of automated sequential decision making, and has been addressed by researchers in many different fields, including AI planning, decision analysis, operations research, control theory and economics. While the assumptions and perspectives ..."
Abstract

Cited by 510 (4 self)
 Add to MetaCart
related methods, showing how they provide a unifying framework for modeling many classes of planning problems studied in AI. It also describes structural properties of MDPs that, when exhibited by particular classes of problems, can be exploited in the construction of optimal or approximately optimal policies
Reroute
, 2014
"... draftietfrtgwgmrtfrralgorithm01 A complete solution for IP and LDP FastReroute using Maximally Redundant Trees is presented in [ID.ietfrtgwgmrtfrrarchitecture]. This document defines the associated MRT Lowpoint algorithm that is used in the default MRT profile to compute both the necessar ..."
Abstract
 Add to MetaCart
draftietfrtgwgmrtfrralgorithm01 A complete solution for IP and LDP FastReroute using Maximally Redundant Trees is presented in [ID.ietfrtgwgmrtfrrarchitecture]. This document defines the associated MRT Lowpoint algorithm that is used in the default MRT profile to compute both
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze
Results 1  10
of
87,238