Sciweavers

2040 search results - page 213 / 408
» Approximate Expectation Maximization
Sort
View
134
Voted
UAI
2008
15 years 5 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
127
Voted
UAI
2008
15 years 5 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony
138
Voted
AAAI
2004
15 years 5 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck
127
Voted
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
15 years 3 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
138
Voted
ECIR
2010
Springer
15 years 3 months ago
Learning to Distribute Queries into Web Search Nodes
Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to regist...
Marcelo Mendoza, Mauricio Marín, Flavio Fer...