368 search results - page 70 / 74 » Sphere Methods for LP |
174
click to vote
AGP
2010
IEEE
15 years 4 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
ICWE
2010
Springer
15 years 4 months ago
2010
Springer
: © A visual tool for rapid integration of enterprise software applications Inbal Marhaim, Eli Mordechai, Claudio Bartolini, Ruth Bergman, Oren Ariel, Christopher Peltz HP Laborat...
103
Voted
CCO
2001
Springer
15 years 4 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
102
click to vote
JC
2007
14 years 11 months ago
2007
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
84
Voted
SECRYPT
2010
14 years 9 months ago
2010
: EnCoRe: Towards a holistic approach to privacy Nick Papanikolaou, Sadie Creese, Michael Goldsmith, Marco Casassa Mont, Siani Pearson HP Laboratories HPL-2010-83 privacy policies...