2652 search results - page 181 / 531 » Privacy-preserving linear programming |
145
Voted
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
143
Voted
COLOGNETWENTE
2009
15 years 4 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
103
click to vote
JISE
2006
15 years 3 months ago
2006
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
124
Voted
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
110
click to vote
OL
2010
15 years 1 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...