Sciweavers

1927 search results - page 184 / 386
» UMDAs for dynamic optimization problems
Sort
View
144
Voted
CJ
1999
126views more  CJ 1999»
15 years 3 months ago
Source Level Static Branch Prediction
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and...
W. F. Wong
112
Voted
TSMC
2002
80views more  TSMC 2002»
15 years 3 months ago
A feedforward neural network controlling the movement of a 3-DOF finger
This paper describes the dynamic control of a 3 degree of freedom (DOF) finger emulating a human finger for reaching a desired fingertip position in space. The control consists of ...
Emanuele Lindo Secco, Giovanni Magenes
132
Voted
CP
2010
Springer
15 years 2 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
146
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 12 days ago
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Z...
131
Voted
IPSN
2004
Springer
15 years 9 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...