127 search results - page 3 / 26 » Acyclic dominating partitions |
BIRTHDAY
2009
Springer
14 years 1 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
JAIR
2008
13 years 6 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
HICSS
2003
IEEE
13 years 11 months ago
2003
IEEE
This paper1 provides a view of modeling the information dominance problem of military systems as representative of modeling other complex systems. The ideas are an extension of ea...
CORR
2011
Springer
12 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...
ECRTS
2010
IEEE
13 years 7 months ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...