Sciweavers

77 search results - page 8 / 16
» Markov Approximation for Combinatorial Network Optimization
Sort
View
ICMCS
2006
IEEE
111views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Optimized Rate Allocation for Unbalanced Multiple Description Video Coding Over Unreliable Packet Network
Video transmission over unreliable packet network is in general hampered by the packet losses and constraint by stringent playback deadline. With these two key factors in consider...
Bin Li, Feng Huang, Lifeng Shu, Shiqiang Yang
AAAI
1996
14 years 11 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
JAIR
2010
115views more  JAIR 2010»
14 years 8 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
JMLR
2010
149views more  JMLR 2010»
14 years 4 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
DEDS
2010
130views more  DEDS 2010»
14 years 9 months ago
Message Batching in Wireless Sensor Networks - A Perturbation Analysis Approach
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
Xu Ning, Christos G. Cassandras