526 search results - page 78 / 106 » Efficient Algorithms for Online Decision Problems |
133
click to vote
AAAI
2006
15 years 5 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
130
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
141
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
245
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
144
click to vote
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...