Sciweavers

2421 search results - page 246 / 485
» Approximate Flow-Aware Networking
Sort
View
AMAI
2008
Springer
15 years 4 months ago
Bayesian learning of Bayesian networks with informative priors
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
Nicos Angelopoulos, James Cussens
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
IJCNN
2008
IEEE
15 years 10 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 8 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
APIN
2004
89views more  APIN 2004»
15 years 3 months ago
A Prototypical System for Soft Evidential Update
Autonomous agents that communicate using probabilistic information and use Bayesian networks for knowledge representation need an update mechanism that goes beyond conditioning on ...
Young-Gyun Kim, Marco Valtorta, Jirí Vomlel