243 search results - page 22 / 49 » An optimal local approximation algorithm for max-min linear ... |
IJCAI
1997
13 years 9 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
JAIR
2010
13 years 6 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
AUTOMATICA
2008
13 years 8 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...