Results 251 to 260 of about 1,258,420 (289)

Signed directed acyclic graphs for causal inference

Journal of the Royal Statistical Society Series B: Statistical Methodology, 2010
Formal rules governing signed edges on causal directed acyclic graphs are described and it is shown how these rules can be useful in reasoning about causality. Specifically, the notions of a monotonic effect, a weak monotonic effect and a signed edge are
James M Robins, Tyler VanderWeele
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Recursive Processing of Directed Acyclic Graphs

2002
Recursive neural networks axe a new connectionist model particularly tailored to process Directed Positional Acyclic Graphs (DPAGs) [4]. While this assumption is reasonable in some applications, it introduces unnecessary constraints in others. In this paper, it is shown that the constraint on the ordering can be relaxed by using an appropriate weight ...
BIANCHINI M., GORI M., SCARSELLI F.
openaire   +3 more sources

Heuristic chaining in directed acyclic graphs

Computer Languages, 1993
Summary: We look at the problem of generating code with instruction chaining from directed acyclic graphs (DAGs). The problem is shown to be NP-complete. A simple heuristic for the problem is devised and its performance is compared with existing methods. The heuristic is shown to generate good code especially when the number of registers is large. Also
Venugopal, R, Srikant, YN
openaire   +1 more source

Retiming DAGs [direct acyclic graph]

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998
This paper is devoted to a low-complexity algorithm for retiming circuits without cycles, i.e., those whose network graph is a direct acyclic graph (DAG). On one hand, DAGs have a great practical importance, as shown by the on-line arithmetic circuits used as a target application in this paper.
Pierre-Yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, Frédéric Vivien   +4 more
openaire   +2 more sources

Analyzing Directed Acyclic Graph Recombination

2001
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described.
Carlos Cotta, José M. Troya
openaire   +2 more sources

Steiner problems on directed acyclic graphs

1996
Two variations of the minimum-cost Steiner problem on a directed acyclic graph with non-negative weights edges are studied.
Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee   +3 more
openaire   +2 more sources

Use of directed acyclic graphs (DAGs) to identify confounders in applied health research: review and recommendations.

International Journal of Epidemiology, 2021
Mark S Gilthorpe, George T.H. Ellison, Matthew Patrick Fox   +2 more
exaly  

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data

INFORMS Journal on Optimization, 2021
Simge Kucukyavuz, Ali Shojaie, Hao-Hsiang Wu   +2 more
exaly  

Evidence synthesis for constructing directed acyclic graphs (ESC-DAGs): a novel and systematic method for building directed acyclic graphs.

International Journal of Epidemiology, 2020
Srinivasa Katikireddi, Daniel J. Smith, Jim Lewsey   +2 more
exaly  

Likelihood Ratio Tests for a Large Directed Acyclic Graph

Journal of the American Statistical Association, 2020
Wei Pan, Xiaotong Shen, Chunlin Li
exaly