9841 search results - page 456 / 1969 » Distributed Value Functions |
174
click to vote
LPAR
2005
Springer
16 years 10 days ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
178
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transfer...
135
click to vote
APAL
2008
15 years 7 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
170
click to vote
PODC
1999
ACM
15 years 11 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
209
click to vote
CCGRID
2001
IEEE
15 years 10 months ago
2001
IEEE
Charging of services in a distributed system will become more and more important for systems which are utilized commercially. Such an important distributed system exists in form o...