4843 search results - page 381 / 969 » The Shortcut Problem - Complexity and Approximation |
126
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
138
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
122
click to vote
NIPS
2003
15 years 5 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
180
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
123
click to vote
JDA
2008
15 years 4 months ago
2008
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...