Sciweavers

2714 search results - page 249 / 543
» Approximation Schemes for Scheduling
Sort
View
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
15 years 10 months ago
Reinforcement learning in multi-dimensional state-action space using random rectangular coarse coding and Gibbs sampling
: This paper presents a coarse coding technique and an action selection scheme for reinforcement learning (RL) in multi-dimensional and continuous state-action spaces following con...
Kimura Kimura
122
Voted
JAIR
2010
130views more  JAIR 2010»
15 years 2 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
ICS
2001
Tsinghua U.
15 years 9 months ago
Reducing the complexity of the issue logic
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
Ramon Canal, Antonio González
ADBIS
1998
Springer
180views Database» more  ADBIS 1998»
15 years 8 months ago
Designing Persistence for Real-Time Distributed Object Systems
An implementation of persistent object store for real-time systems with strict processing time constraints is a challenging task, because many traditional database techniques, e.g....
Igor Nekrestyanov, Boris Novikov, Ekaterina Pavlov...
JSAC
2007
79views more  JSAC 2007»
15 years 4 months ago
Fundamental Limits in MIMO Broadcast Channels
— This paper studies the fundamental limits of MIMO broadcast channels from a high level, determining the sum-rate capacity of the system as a function of system paramaters, such...
Babak Hassibi, Masoud Sharif