An efficient method for computing exact path delay fault coverage [PDF]
, 2002 B. Kapoor
openalex +1 more source
Deciding Reachability in a Directed Graph given its Path Decomposition [PDF]
arXivDeciding if there exists a path from one vertex to another in a graph is known as the s-t connectivity or the reachability problem. Reachability can be solved using graph traversal algorithms like Depth First Search(DFS) or Breadth First Search(BFS) in linear time but these algorithms also take linear space.
arxiv
Motion Planning in Irreducible Path Spaces [PDF]
arXiv, 2018 The motion of a mechanical system can be defined as a path through its configuration space. Computing such a path has a computational complexity scaling exponentially with the dimensionality of the configuration space. We propose to reduce the dimensionality of the configuration space by introducing the irreducible path --- a path having a minimal ...
arxiv
VHSAP-based approach of defending against DDoS attacks for cloud computing routing platforms
Tongxin xuebao, 2015 Based on the analysis of security overlay service (SOS) approach of defending against DDoS attacks in large scale network,the vulnerability in the exit mechanism of being attacked nodes in SOS approach is explored.The vulnerability is solved by improving
UZhi-jun W, UIYi C, UEMeng Y
doaj +2 more sources
Inter-Satellite Cooperative Computing Scheme Driven by Business Graph in LEO Satellite Network
天地一体化信息网络, 2021 Low earth orbit-satellite network (LEO-SN) has the advantages of wide coverage and short satellite-to-earth link, and has become a current hot research fi eld.A business graph-driven inter-satellite collaborative computing method in LEO-SN was proposed ...
Xiaobo GUO +3 more
doaj
Applying Open-Path FTIR with Computed Tomography to Evaluate Personal Exposures. Part 1: Simulation Studies [PDF]
, 2004 Chang‐Fu Wu +4 more
openalex +1 more source
A Fourier‐transform path integral formalism to compute dispersion probability distributions in variable ocean environments [PDF]
, 2007 Alberto Álvarez +3 more
openalex +1 more source
Routing algorithm for heterogeneous computing force requests based on computing first network
Dianxin kexueDue to the particularity and uniqueness of computing force requests, how to find an effective path set with non-intersecting transmission links for a group of heterogeneous computing force requests, so that the group of requests can reach their ...
ZHANG Gang, LI Xi
doaj
Algorithms for Automatically Computing the Causal Paths of Failures [PDF]
, 2009 William N. Sumner, Xiangyu Zhang
openalex +1 more source
Directed Acyclic Task Graph Scheduling for Heterogeneous Computing Systems by Dynamic Critical Path Duplication Algorithm [PDF]
, 2009 Fei Yin +3 more
openalex +1 more source