778 search results - page 90 / 156 » Expressiveness and complexity of graph logic |
114
click to vote
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
134
click to vote
BMCBI
2010
15 years 17 days ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
126
click to vote
CLIMA
2004
15 years 1 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
115
Voted
JMLR
2010
14 years 7 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
98
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...