1067 search results - page 65 / 214 » Probabilistic regular graphs |
156
Voted
VOSS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
102
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
101
Voted
JCT
2011
14 years 7 months ago
2011
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
117
Voted
DAGM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
130
Voted
AIPS
2006
15 years 2 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...