Results 171 to 180 of about 1,480,544 (205)
Some of the next articles are maybe not open access.
Analyzing Directed Acyclic Graph Recombination
2001This 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
1996Two variations of the minimum-cost Steiner problem on a directed acyclic graph with non-negative weights edges are studied.
Tsan-sheng Hsu +3 more
openaire +2 more sources
Integer Programming for Learning Directed Acyclic Graphs from Continuous Data
INFORMS Journal on Optimization, 2021Simge Kucukyavuz +2 more
exaly
Proceedings of the 12th Workshop on Principles and Practice of Consistency for Distributed Data
Evelyn Borth +2 more
openaire +1 more source
Evelyn Borth +2 more
openaire +1 more source
Directed Acyclic Graphs, Effect Measure Modification, and Generalizability
American Journal of Epidemiology, 2021Alexander Breskin, Michael Webster-Clark
exaly
Markov Properties for Acyclic Directed Mixed Graphs
Scandinavian Journal of Statistics, 2003Thomas S Richardson
exaly
Episode directed acyclic subsequence graph
Nord. J. Comput., 2004Summary: Given two strings, pattern \(P\) and text \(T\), episode substring of \(P\) in \(T\) is a minimal substring of \(T\) that contains \(P\) as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very ...
openaire +2 more sources