4894 search results - page 639 / 979 » The Guarding Problem - Complexity and Approximation |
156
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
144
click to vote
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 (...
114
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
131
Voted
IWCMC
2009
ACM
15 years 10 months ago
2009
ACM
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
185
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...