1370 search results - page 174 / 274 » On grids in topological graphs |
166
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
194
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
208
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
171
click to vote
AIPS
2011
14 years 10 months ago
2011
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
155
click to vote
CORR
2012
Springer
14 years 2 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....