505 search results - page 61 / 101 » On A Graph Formalism for Ordered Edges |
SAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
76
Voted
IJCAI
2001
14 years 11 months ago
2001
We propose to extend the temporal causal graph formalisms used in model-based diagnosis in order to deal with non trivial interactions like (partial) cancellation of fault effects...
ORDER
2008
14 years 9 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
ECSQARU
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...