10901 search results - page 362 / 2181 » Approximations in Distributed Optimization |
216
click to vote
AAAI
2000
15 years 8 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
187
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
228
click to vote
SIAMSC
2011
15 years 1 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
179
Voted
GLOBECOM
2006
IEEE
16 years 27 days ago
2006
IEEE
Abstract— In this paper, we formulate an optimal rate allocation scheme for uplink and downlink in a single-cell CDMA system. Using concepts from game theory, we show that it is ...
144
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...