1736 search results - page 140 / 348 » The rank-width of Directed Graphs |
118
Voted
AI
2007
Springer
15 years 10 months ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘or...
138
click to vote
ISCAPDCS
2007
15 years 6 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
150
Voted
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
135
click to vote
CORR
2010
Springer
15 years 4 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...
142
click to vote
IPL
2006
15 years 4 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...