Results 21 to 30 of about 1,480,544 (205)

Directed acyclic graph for the mediation analysis.

open access: yes, 2022
Directed acyclic graph for the mediation analysis.
Jison Ki (13020468)   +1 more
core   +1 more source

A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling

open access: yesComputation, 2020
The multiprocessor task scheduling problem has received considerable attention over the last three decades. In this context, a wide range of studies focuses on the design of evolutionary algorithms.
Eduardo C. da Silva, Paulo H. R. Gabriel
doaj   +1 more source

Learning linear non-Gaussian graphical models with multidirected edges

open access: yesJournal of Causal Inference, 2021
In this article, we propose a new method to learn the underlying acyclic mixed graph of a linear non-Gaussian structural equation model with given observational data.
Liu Yiheng, Robeva Elina, Wang Huanqing
doaj   +1 more source

Directed acyclic graph showing study hypothesis with potential confounders.

open access: yes, 2023
Directed acyclic graph showing study hypothesis with potential confounders.
Eunice Lobo (2577373)   +4 more
core   +1 more source

The Reduction of Directed Cyclic Graph for Task Assignment Problem

open access: yesMATEC Web of Conferences, 2018
In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists.
Ariffin W.N.M.
doaj   +1 more source

The Algebra of Directed Acyclic Graphs [PDF]

open access: yes, 2013
We give an algebraic presentation of directed acyclic graph structure, introducing a symmetric monoidal equational theory whose free PROP we characterise as that of finite abstract dags with input/output interfaces. Our development provides an initial-algebra semantics for dag structure.
Marcelo P. Fiore, Marco Devesas Campos
openaire   +3 more sources

Covering Pairs in Directed Acyclic Graphs [PDF]

open access: yesThe Computer Journal, 2014
The Minimum Path Cover (MinPC) problem on directed acyclic graphs (DAGs) is a classical problem in graph theory that provides a clear and simple mathematical formulation for several applications in computational biology. In this paper, we study the computational complexity of three constrained variants of MinPC motivated by the recent introduction of ...
Beerenwinkel, N   +4 more
openaire   +7 more sources

Fault diagnosis of rotating machines for rail vehicles based on local mean decomposition—energy moment—directed acyclic graph support vector machine

open access: yesAdvances in Mechanical Engineering, 2016
In order to accurately perform fault diagnosis of key rotating machines of rail vehicles, a new method for diagnosis was proposed, based on local mean decomposition—energy moment—directed acyclic graph support vector machine.
Yanping Du   +4 more
doaj   +1 more source

Combined Deep Learning With Directed Acyclic Graph SVM for Local Adjustment of Age Estimation

open access: yesIEEE Access, 2021
In order to further improve the accuracy of age estimation, a locally adjusted age estimation algorithm based on deep learning and directed acyclic graph SVM is proposed.
Cui Xiao   +3 more
doaj   +1 more source

The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs

open access: yesThe Electronic Journal of Combinatorics, 2022
Let $H$ be a directed acyclic graph (dag) that is not a rooted star. It is known that there are constants $c=c(H)$ and $C=C(H)$ such that the following holds for $D_n$, the complete directed graph on $n$ vertices. There is a set of at most $C\log n$ directed acyclic subgraphs of $D_n$ that covers every $H$-copy of $D_n$, while every set of at most $c ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy