7129 search results - page 1106 / 1426 » Approximation Algorithms for Treewidth |
125
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
141
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
133
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
143
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...
149
Voted
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...