206 search results - page 37 / 42 » Better Bounds for Online Scheduling |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
ASPDAC
2009
ACM
15 years 6 months ago
2009
ACM
— Thermal balancing and reducing hot-spots are two important challenges facing the MPSoC designers. In this work, we model the thermal behavior of a MPSoC as a control theory pro...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
110
click to vote
CDC
2010
IEEE
14 years 3 months ago
2010
IEEE
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...
78
Voted
CP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...