Results 251 to 260 of about 1,255,138 (288)
This source code implements a unified framework for pre-processing Directed Acyclic Graphs (DAGs) to lookup reachability between two vertices as well as compute the least upper bound of two vertices in constant time.
Dominique Haughton +2 more
core +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Recursive Processing of Directed Acyclic Graphs
2002Recursive 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, 1993Summary: 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, 1998This 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 +4 more
openaire +2 more sources
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