1064 search results - page 112 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
151
click to vote
ESANN
2008
15 years 5 months ago
2008
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
132
click to vote
4OR
2006
15 years 4 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
115
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
129
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
The average consensus problem in the distributed signal processing context is addressed by linear iterative algorithms, with asymptotic convergence to the consensus. The convergen...
144
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...