7129 search results - page 467 / 1426 » Approximation Algorithms for Treewidth |
166
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
181
click to vote
ICCS
2007
Springer
16 years 19 days ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
163
click to vote
WINE
2007
Springer
16 years 17 days ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
154
click to vote
ICAI
2007
15 years 8 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
162
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...