12519 search results - page 266 / 2504 » Approximation Problems Categories |
169
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
180
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
175
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
271
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
172
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...