567 search results - page 103 / 114 » Regularized Policy Iteration |
160
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
136
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
149
click to vote
IJHPCA
2007
15 years 3 months ago
2007
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
136
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
142
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...