Results 1 to 10 of about 1,480,544 (205)
A directed acyclic graph for interactions [PDF]
International Journal of Epidemiology, 2020 Abstract Background Directed acyclic graphs (DAGs) are of great help when researchers try to understand the nature of causal relationships and the consequences of conditioning on different variables.
Anton Nilsson +3 more
openaire +3 more sources
Cycle analysis of Directed Acyclic Graphs
Physica A: Statistical Mechanics and Its Applications, 2022 In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected graph and augment its components with direction information. We show that only four classes of directed cycles exist,
Paul Expert +2 more
exaly +6 more sources
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs [PDF]
SIAM Journal of Scientific Computing, 2019 Summary: We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as the edge cut. The standard load balancing constraint of having an equitable partition of
Kamer Kaya, Bora Uçar, Umit Catalyurek
exaly +4 more sources
Design and Implementation of Solution Algorithm for Foreign Key Conflict Based on Directed Graph [PDF]
Jisuanji gongcheng, 2021 As one of the important constraints in relational databases,foreign keys play an important role in constraining the order of operations of the database.However,in some cases,users cannot know the order of operations,causing foreign key conflicts.To solve
WANG Zhiduo, JIANG Bo, MIAO Rui, ZHAO Hui
doaj +1 more source
Survey of Directed Acyclic Graph Based Blockchain Technology [PDF]
Jisuanji gongcheng, 2022 Blockchain technology has been widely used in finance, public services, the Internet of Things(IoT), network security, supply chains, and other fields.However, the traditional blockchain with a single chain structure has some deficiencies in throughput ...
WANG Jinsong, YANG Weizheng, ZHAO Zening, WEI Jiajia
doaj +1 more source
Fuzzing Test Case Generation Method Based on Depth-first Search [PDF]
Jisuanji kexue, 2021 Fuzzing test is an important method to exploit network protocol vulnerability.Existing fuzzing test methods have some problems such as incomplete path coverage and low efficiency.To solve these problems,this paper proposes a depth-first search based ...
LI Yi-hao, HONG Zheng, LIN Pei-hong
doaj +1 more source
Contextual Directed Acyclic Graphs
CoRR, 2023 To appear in the Proceedings of the 27th International Conference on Artificial Intelligence and ...
Ryan Thompson +2 more
openaire +3 more sources
Directed Acyclic Graphs With Tears
IEEE Transactions on Artificial Intelligence, 2023 Bayesian network is a frequently-used method for fault detection and diagnosis in industrial processes. The basis of Bayesian network is structure learning which learns a directed acyclic graph (DAG) from data. However, the search space will scale super-exponentially with the increase of process variables, which makes the data-driven structure learning
Zhichao Chen 0001, Zhiqiang Ge
openaire +3 more sources
Copula Directed Acyclic Graphs [PDF]
SSRN Electronic Journal, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pircalabelu, Eugen +2 more
openaire +3 more sources
Acyclic Partitioning of Large Directed Acyclic Graphs [PDF]
2017 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2017 Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be acyclic, i.e., the inter-part edges between the vertices from different parts should preserve an ...
Herrmann, Julien +4 more
openaire +5 more sources