Sciweavers

2626 search results - page 276 / 526
» The complexity of stochastic sequences
Sort
View
ATAL
2010
Springer
15 years 7 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ECAI
2010
Springer
15 years 7 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
EUROPAR
2010
Springer
15 years 7 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
Huanyu Zhao, Xin Yang, Xiaolin Li
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
DATAMINE
2010
175views more  DATAMINE 2010»
15 years 6 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...