2652 search results - page 446 / 531 » Privacy-preserving linear programming |
146
click to vote
JCO
2006
14 years 10 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
DISOPT
2007
14 years 10 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
JSAC
2006
14 years 9 months ago
2006
Wireless backhaul communication is expected to play a significant role in providing the necessary backhaul resources for future high-rate wireless networks. Mesh networking, in whi...
JSAT
2006
14 years 9 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
OL
2008
14 years 9 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...