2652 search results - page 32 / 531 » Privacy-preserving linear programming |
SIAMCO
2008
14 years 9 months ago
2008
It has been established recently that, under mild conditions, deterministic long run average problems of optimal control are "asymptotically equivalent" to infinite-dimen...
PPDP
2010
Springer
14 years 7 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
ENDM
2010
14 years 7 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
112
click to vote
AAAI
2011
13 years 9 months ago
2011
Sustainable resource management in many domains presents large continuous stochastic optimization problems, which can often be modeled as Markov decision processes (MDPs). To solv...
MP
2006
14 years 9 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...