3780 search results - page 246 / 756 » Algorithms for Game Metrics |
198
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
189
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...
183
click to vote
TCS
2008
15 years 7 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
193
click to vote
FLAIRS
2009
15 years 5 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
207
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...