نتایج جستجو برای: cuts method

تعداد نتایج: 1640190  

Journal: :Math. Program. 1998
Jacek Gondzio

A practical warm-start procedure is described for the infeasible primal-dual interior-point method employed to solve the restricted master problem within the cutting-plane method. In contrast to the theoretical developments in this eld, the approach presented in this paper does not make the unrealistic assumption that the new cuts are shallow. Moreover, it treats systematically the case when a ...

2006
RANGA RODRIGO ZHENHE CHEN

This paper describes an optimal method of inserting new frames or recovering missing frames in a video sequence. The method is based on an optimization scheme using graph-cuts that finds the ‘optimal’ frames to be inserted in between two given frames. The core problem is a typical visual correspondence problem between pixels in two or more frames and having formulated the appropriate energy, gr...

2005
Kevin J. Lang

We discuss two intrinsic weaknesses of the spectral graph partitioning method, both of which have practical consequences. The first is that spectral embeddings tend to hide the best cuts from the commonly used hyperplane rounding method. Rather than cleaning up the resulting suboptimal cuts with local search, we recommend the adoption of flow-based rounding. The second weakness is that for many...

1996
Jacek Gondzio

A practical warm-start procedure is described for the infeasible primal-dual interior-point method employed to solve the restricted master problem within the cutting-plane method. In contrast to the theoretical developments in this eld, the approach presented in this paper does not make the unrealistic assumption that the new cuts are shallow. Moreover, it treats systematically the case when a ...

2008
Matthew W. Tanner Lewis Ntaimo

We present a new method for solving stochastic programs with joint chance constraints with random technology matrices and discretely distributed random data. The problem can be reformulated as a large-scale mixed 0-1 integer program. We derive a new class of optimality cuts called IIS cuts and apply them to our problem. The cuts are based on irreducibly infeasible subsets (IIS) of an LP defined...

Journal: :Biomedizinische Technik. Biomedical engineering 2013
S Besdo J Wiegand J Hahn T Ripken A Krüger M Fromm H Lubatschowski

With aging the ability of the crystalline lens to adapt to different viewing distances decreases. Until now there is no satisfying treatment available. It is possible to influence the deformability of the crystalline lens by inducing cuts using femtosecond (fs)-laser. To test the influence of several different cutting geometries is expensive and a huge amount of crystalline lenses is needed. Fi...

Journal: :Journal of computational biology : a journal of computational molecular cell biology 2005
Anton Valouev Lei Li Yu-Chi Liu David C. Schwartz Yi Yang Yu Zhang Michael S. Waterman

We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment score through calculation of corresponding likelihoods. The size error model is derived through the application of Central Limit Theorem and validated by residual plots collected from real data. Missing cuts and false...

Journal: :Meat science 2011
H C Schönfeldt P E Strydom

The juiciness and flavour characteristics of 15 aged primal beef cuts of electrically stimulated carcasses, from three different age groups, were assessed (n=61). Cooking losses were determined and proximate analyses (moisture, fat, nitrogen and ash) were performed. Tender cuts were cooked by a dry heat method, and less tender cuts were cooked by moist heat methods. A trained panel (n=10) evalu...

Journal: :Acta Mathematica 1964

Journal: :Theor. Comput. Sci. 2018
Alexander Leitsch Michael Peter Lettmann

We describe an algorithmic method of proof compression based on the introduction of Π2-cuts into a cut-free LK-proof. This method extends previous research on the introduction of Π1-cuts and is based on a connection between proof theory and formal language theory. Given is a cut-free proof π of a sequent S and a so called schematic Π2-grammar G, a grammar formalizing the substitutions of quanti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید