8 search results - page 1 / 2 » Directed Searching Digraphs: Monotonicity and Complexity |
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider graph searching games on directed graphs and corresponding digraph decompositions. In particular we show that two important variants of these games
GC
2006
Springer
13 years 5 months ago
2006
Springer
ECCC
2010
13 years 2 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
AI
2002
Springer
13 years 4 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...