17760 search results - page 197 / 3552 » A Generalization of the Massey-Ding Algorithm |
143
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
114
click to vote
WDAG
2009
Springer
15 years 11 months ago
2009
Springer
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
137
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
143
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliab...
182
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...