Sciweavers

372 search results - page 41 / 75
» The box mover problem
Sort
View
CPAIOR
2010
Springer
15 years 3 months ago
Automated Configuration of Mixed Integer Programming Solvers
Abstract. State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific ...
Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
AAAI
2008
15 years 2 months ago
Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
Craig Boutilier, David C. Parkes, Tuomas Sandholm,...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 1 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
PTS
2007
97views Hardware» more  PTS 2007»
15 years 1 months ago
Learning and Integration of Parameterized Components Through Testing
Abstract. We investigate the use of parameterized state machine models to drive integration testing, in the case where the models of components are not available beforehand. Theref...
Muzammil Shahbaz, Keqin Li 0002, Roland Groz
DAGSTUHL
2006
15 years 1 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee