1695 search results - page 267 / 339 » Linear, Polynomial or Exponential |
156
click to vote
UAI
2008
15 years 5 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
139
click to vote
AAAI
2006
15 years 5 months ago
2006
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
126
click to vote
FLAIRS
2006
15 years 5 months ago
2006
A major difficulty in building Bayesian network models is the size of conditional probability tables, which grow exponentially in the number of parents. One way of dealing with th...
115
Voted
UAI
2001
15 years 5 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
143
click to vote
IJCAI
2003
15 years 5 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...