Sciweavers

1176 search results - page 134 / 236
» Sparse reward processes
Sort
View
ATAL
2004
Springer
15 years 10 months ago
Learning User Preferences for Wireless Services Provisioning
The problem of interest is how to dynamically allocate wireless access services in a competitive market which implements a take-it-or-leave-it allocation mechanism. In this paper ...
George Lee, Steven Bauer, Peyman Faratin, John Wro...
RTCSA
2000
IEEE
15 years 8 months ago
Optimal scheduling of imprecise computation tasks in the presence of multiple faults
With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision”...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
FUZZIEEE
2007
IEEE
15 years 8 months ago
Genetic Fuzzy Systems applied to Online Job Scheduling
Abstract-- This paper presents a comparison of three different design concepts for Genetic Fuzzy systems. We apply a Symbiotic Evolution that uses the Michigan approach and two app...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 7 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
ATAL
2008
Springer
15 years 6 months ago
Expediting RL by using graphical structures
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
Peng Dai, Alexander L. Strehl, Judy Goldsmith