429 search results - page 81 / 86 » Solving the Maximum Clique Problem Using PUBB |
165
click to vote
MICRO
2002
IEEE
15 years 8 months ago
2002
IEEE
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
160
click to vote
TNN
2011
14 years 10 months ago
2011
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
185
click to vote
AAAI
2008
15 years 5 months ago
2008
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
146
click to vote
NIPS
2004
15 years 4 months ago
2004
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
142
click to vote
LION
2007
Springer
15 years 9 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...