192 search results - page 8 / 39 » Cut Points in PEG |
101
click to vote
EMMCVPR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
MP
2010
14 years 8 months ago
2010
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
SIAMJO
2010
14 years 4 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
MOR
2002
14 years 9 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
106
click to vote
AAAI
1994
14 years 11 months ago
1994
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...