641 search results - page 90 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
TSP
2010
14 years 4 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
63
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
64
Voted
NIPS
2007
14 years 11 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
AAECC
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
TIT
2008
14 years 9 months ago
2008
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...