359 search results - page 27 / 72 » Multi-state Directed Acyclic Graphs |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
94
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
86
Voted
DAM
2007
14 years 11 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
TNN
1998
14 years 11 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....