3875 search results - page 207 / 775 » Approximation algorithms for the 0-extension problem |
157
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
151
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
203
click to vote
ACST
2006
15 years 7 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
231
click to vote
ICDCIT
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
191
click to vote
ICML
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...