2652 search results - page 91 / 531 » Privacy-preserving linear programming |
TIT
2011
14 years 6 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
VLSID
2007
IEEE
16 years 6 days ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
108
click to vote
SIAMJO
2000
14 years 11 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...