Sciweavers

74 search results - page 10 / 15
» Optimal robust expensive optimization is tractable
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
JCC
2010
74views more  JCC 2010»
13 years 7 months ago
A first-order system least-squares finite element method for the Poisson-Boltzmann equation
The Poisson-Boltzmann equation is an important tool in modeling solvent in biomolecular systems. In this paper, we focus on numerical approximations to the electrostatic potential...
Stephen D. Bond, Jehanzeb Hameed Chaudhry, Eric C....
WINE
2010
Springer
148views Economy» more  WINE 2010»
13 years 6 months ago
False-Name-Proofness in Social Networks
In mechanism design, the goal is to create rules for making a decision based on the preferences of multiple parties (agents), while taking into account that agents may behave stra...
Vincent Conitzer, Nicole Immorlica, Joshua Letchfo...
ICML
2009
IEEE
14 years 9 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 8 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho