Results 41 to 50 of about 1,480,544 (205)
ICT Express, 2018 Task scheduling is one of the most important issues in heterogeneous environments when high efficiency is required. Because task scheduling is a Nondeterministic Polynomial (NP)-hard problem, many evolutionary algorithms have been adopted to solve this ...
Negar Dordaie, Nima Jafari Navimipour
doaj +1 more source
Enhancing the blockchain interoperability through federated learning with directed acyclic graph
IET Blockchain, 2023 The use of federated learning to achieve blockchain interoperability has become a hot topic in research, because it enables data exchange without revealing any private information.
Feng Xia, Li Kaiye, Wu Songze, Xin yan
doaj +1 more source
Ternary directed acyclic word graphs
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satoru Miyamoto +3 more
openaire +4 more sources
Directed acyclic graph describing the hypothesized relationships.
, 2012 Directed acyclic graph describing the hypothesized relationships.
Mark Daniel (173278) +13 more
core +1 more source
IEEE Access, 2022 Learning the structure of Bayesian networks is a challenging problem because it is a NP-Hard problem. As an excellent search & score based method, the K2 algorithm strongly depends on the input of global order of all nodes to ensure the result is ...
Kunhua Zhong +3 more
doaj +1 more source
Transformers over Directed Acyclic Graphs
Advances in Neural Information Processing Systems 36, 2023 Transformer models have recently gained popularity in graph representation learning as they have the potential to learn complex relationships beyond the ones captured by regular graph neural networks. The main research question is how to inject the structural bias of graphs into the transformer architecture, and several proposals have been made for ...
Yuankai Luo +2 more
openaire +3 more sources
Optimizing Iterative Data-Flow Scientific Applications Using Directed Cyclic Graphs
IEEE Access, 2023 Data-flow programming models have become a popular choice for writing parallel applications as an alternative to traditional work-sharing parallelism. They are better suited to write applications with irregular parallelism that can present load imbalance.
David Alvarez, Vicenc Beltran
doaj +1 more source
DIGRUNDY NUMBER OF DIRECTED STAR, BANANA TREE, FIREWORKS, AND COCONUT TREE GRAPHS
BarekengA digrundy coloring of a graph is a vertex coloring in which every vertex assigned a higher color is adjacent to vertices assigned all smaller colors. The maximum number of colors that can be realized in such a coloring of an acyclic directed graph is ...
Raventino Raventino, Fransiskus Fran
doaj +1 more source
On Layering Directed Acyclic Graphs
, 2006 We consider the problem of layering a directed acyclic graph with minimum dummy nodes. We present a new Integer Linear Programming (ILP) formulation of the problem based on a set of fundamental cycles in the underlying undirected graph and show that it can be solved in polynomial time. We outline some of the advantages of the formulation. Each solution
Harrigan, Martin, Healy, Patrick
openaire +4 more sources
Directed acyclic subsequence graph—Overview
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Crochemore, M, Melichar, B, Tronek, Z
openaire +2 more sources