697 search results - page 134 / 140 » Convex Functions on Discrete Sets |
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
LSSC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We review some recent developments in the coupling of atomistic and continuum models based on the blending of the two models in a bridge region connecting the other two r...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
CCO
2001
Springer
13 years 12 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...