Sciweavers

406 search results - page 32 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
14 years 1 months ago
Nonlinear parametric regression in genetic programming
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...
Yung-Keun Kwon, Sung-Soon Choi, Byung Ro Moon
DISOPT
2008
138views more  DISOPT 2008»
13 years 10 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
JAIR
2010
115views more  JAIR 2010»
13 years 8 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
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...
Raghav Aras, Alain Dutech
JMLR
2010
155views more  JMLR 2010»
13 years 8 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
MFCS
2009
Springer
14 years 2 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...