نتایج جستجو برای: directed acyclic graph dag

تعداد نتایج: 343448  

2003
Yangjun Chen

A composite object represented as a directed graph is an important data structure which requires efficient support in CAD/CAM, CASE, office systems, software management, Web databases and document databases. It is cumbersome to handle such an object in relational database systems when it involves recursive relationships. In this chapter, we present a new encoding method to support the efficient...

Journal: :J. Comb. Optim. 2005
Chunfang Zheng David Sankoff

Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due to markers missing from some sources. We represent each chromosome as a partial order, summarized by a directed acyclic graph (DAG), to account for poor resolution and of missing data. The genome rearrangement problem...

Journal: :CoRR 2012
Jingwei Liu

The extension of counterfactual causal graphic model with three variables of vertex set in directed acyclic graph (DAG) is discussed in this paper by extending twovalue distribution to three-value distribution of the variables involved in DAG. Using the conditional independence as ancillary information, 6 kinds of extension counterfactual causal graphic models with some variables are extended f...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

Learning directed acyclic graph (DAG) that describes the causality of observed data is a very challenging but important task. Due to limited quantity and quality data, non-identifiability causal graph, it almost impossible infer single precise DAG. Some methods approximate posterior distribution DAGs explore DAG space via Markov chain Monte Carlo (MCMC), over nature super-exponential growth, ac...

Journal: :Electronic Journal of Statistics 2021

Recursive max-linear vectors model causal dependence between node variables by a structural equation model, expressing each variable as function of its parental nodes in directed acyclic graph (DAG) and some exogenous innovation. For such there exists unique minimum DAG, represented the Kleene star matrix edge weight matrix, which identifies can be estimated. more realistic statistical modeling...

2015
Shivani Sachdeva Poonam Panwar

Scheduling parallel tasks on multiprocessor systems is to allocate a set of tasks to processors such that the optimal usage of processors and accepted computation time for scheduling algorithm are obtained. In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The need for ...

Journal: :Lecture Notes in Computer Science 2023

The page-number of a directed acyclic graph (a DAG, for short) is the minimum k which DAG has topological order and k-coloring its edges such that no two same color cross, i.e., have alternating endpoints along order. In 1999, Heath Pemmaraju conjectured recognition DAGs with 2 NP-complete proved recognizing 6 [SIAM J. Computing, 1999]. Binucci et al. recently strengthened this result by provin...

2011
GUIPING WANG YAN WANG

Grid workflow and its application are one of main focuses of Grid Computing. Due to data or control dependencies between tasks and the requirement of no directed circuit, Directed Acyclic Graph (DAG) is a natural model for Grid workflow, and has been extensively used in Grid workflow modeling. For some workflow applications, there may exist another requirement that each task should be accomplis...

Journal: :Statistics and Computing 2016
Chris J. Oates Jim Q. Smith Sach Mukherjee James Cussens

Abstract. This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the vertices in each DAG share a common ordering. Furthermore, we allow al...

2002
Alberto Roverato Guido Consonni

The application of certain Bayesian techniques, such as the Bayes factor and model averaging, requires the specification of prior distributions on the parameters of alternative models. We propose a new method for constructing compatible priors on the parameters of models nested in a given DAG (Directed Acyclic Graph) model, using a conditioning approach. We define a class of parameterisations c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید