Sciweavers

2652 search results - page 292 / 531
» Privacy-preserving linear programming
Sort
View
129
Voted
ICML
2008
IEEE
16 years 4 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
128
Voted
COR
2010
123views more  COR 2010»
15 years 3 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
BMCBI
2006
107views more  BMCBI 2006»
15 years 3 months ago
Analysis of optimal phenotypic space using elementary modes as applied to Corynebacterium glutamicum
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
Kalyan Gayen, K. V. Venkatesh
MP
2008
99views more  MP 2008»
15 years 3 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph