16666 search results - page 83 / 3334 » Descriptive and Computational Complexity |
136
Voted
TSP
2010
14 years 10 months ago
2010
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
114
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
101
Voted
EOR
2002
15 years 3 months ago
2002
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
165
click to vote
MST
2011
14 years 10 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
147
Voted
ECWEB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...