7930 search results - page 1273 / 1586 » Greedy in Approximation Algorithms |
140
click to vote
WG
2009
Springer
16 years 20 days ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
166
click to vote
ATAL
2009
Springer
16 years 20 days 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 (...
160
Voted
ATAL
2009
Springer
16 years 20 days 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...
181
Voted
ATAL
2009
Springer
16 years 20 days 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...
142
click to vote
ESA
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...