2652 search results - page 41 / 531 » Privacy-preserving linear programming |
117
click to vote
CP
2010
Springer
14 years 8 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
167
click to vote
MP
2011
14 years 18 days ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
The notion of evolvability has been put forward to describe the“core mechanism”of natural and artificial evolution. Recently, studies have revealed the influence of the envi...
PAMI
2007
14 years 9 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...