7930 search results - page 606 / 1586 » Greedy in Approximation Algorithms |
188
click to vote
WINE
2007
Springer
16 years 1 months 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 ...
177
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...
194
click to vote
GECCO
2008
Springer
15 years 8 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...
203
click to vote
DCG
2008
15 years 7 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
212
click to vote
JMLR
2010
15 years 2 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...