4345 search results - page 133 / 869 » Temporal Constraint Networks |
142
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
136
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—We investigate optimal resource allocation for delaylimited cooperative communication in time varying wireless networks. Motivated by real-time applications that have st...
105
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
169
click to vote
JSAC
2011
14 years 7 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
181
click to vote
OL
2011
14 years 11 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...