Results 121 to 130 of about 1,667,420 (169)
Some of the next articles are maybe not open access.
A Cutting Plane Algorithm and a Column Generation Algorithm as Dual Algorithms
Mathematische Operationsforschung und Statistik. Series Optimization, 1978Cutting plane and column generation algorithms are known to be dual in a certain sense. In this paper, a general cutting plane algorithm of Kelley type for convex programs and a general column generation algorithm of Dantzig-Wolfe type for Wolfe's generalized program are described. These two algorithms are shown to be dual. An estimation of the optimal
openaire +1 more source
Journal of Clinical Monitoring, 1987
In this article we present the choices that the designers of any QRS detector must make and explain the constraints we adopted. We outline the signal processing that precedes and the beat analysis that follows QRS detection in our single-channel, arrhythmia-monitoring algorithm and then expound the QRS detection algorithm in detail. Finally, we present
A D, Forbes, H B, Jimison
openaire +2 more sources
In this article we present the choices that the designers of any QRS detector must make and explain the constraints we adopted. We outline the signal processing that precedes and the beat analysis that follows QRS detection in our single-channel, arrhythmia-monitoring algorithm and then expound the QRS detection algorithm in detail. Finally, we present
A D, Forbes, H B, Jimison
openaire +2 more sources
SIAM Journal on Control, 1973
An algorithm for the solution of the nonlinear programming problem with linear constraints is given based on an attempt to satisfy the Kuhn–Tucker conditions. The algorithm utilizes “nearly” active constraints at a feasible point to avoid zigzagging and the convergence proof is based on general conditions developed by Zangwill.
openaire +1 more source
An algorithm for the solution of the nonlinear programming problem with linear constraints is given based on an attempt to satisfy the Kuhn–Tucker conditions. The algorithm utilizes “nearly” active constraints at a feasible point to avoid zigzagging and the convergence proof is based on general conditions developed by Zangwill.
openaire +1 more source
Journal of Algorithms, 1999
Summary: As pointed out by \textit{D. B. West} [Graphs and order. The role of graphs in the theory of ordered sets and its applications, Proc. NATO Adv. Study Inst., Banff/Can. 1984 NATO ASI Ser., Ser. C 147, 267-350 (1985; Zbl 0568.05042)], the hypergraph associated to a poset \(P\) is in general huge. It is therefore suggested that the computation of
Yáñez, Javier, Montero, Javier
openaire +2 more sources
Summary: As pointed out by \textit{D. B. West} [Graphs and order. The role of graphs in the theory of ordered sets and its applications, Proc. NATO Adv. Study Inst., Banff/Can. 1984 NATO ASI Ser., Ser. C 147, 267-350 (1985; Zbl 0568.05042)], the hypergraph associated to a poset \(P\) is in general huge. It is therefore suggested that the computation of
Yáñez, Javier, Montero, Javier
openaire +2 more sources
2010
Suppose we have a set of materials -- e.g., drugs or genes -- some combinations of which react badly together. We can experiment to see whether subsets contain any bad combinations and we want to find a maximal subset that does not. This problem is equivalent to finding a maximal independent set (or minimal vertex cover) in a hypergraph using group ...
Cicalese, Ferdinando +4 more
openaire +3 more sources
Suppose we have a set of materials -- e.g., drugs or genes -- some combinations of which react badly together. We can experiment to see whether subsets contain any bad combinations and we want to find a maximal subset that does not. This problem is equivalent to finding a maximal independent set (or minimal vertex cover) in a hypergraph using group ...
Cicalese, Ferdinando +4 more
openaire +3 more sources
Obesity Surgery, 2002
Three premises underlie this formulation of an algorithm: 1) there is no gold standard operation; 2) the bariatric surgeon should be able to perform more than one bariatric operation; and 3) a patient can be broadly matched to an operation.Literature review and interpretation.The 5 currently clinically-tested bariatric procedures, ranked from least to ...
openaire +2 more sources
Three premises underlie this formulation of an algorithm: 1) there is no gold standard operation; 2) the bariatric surgeon should be able to perform more than one bariatric operation; and 3) a patient can be broadly matched to an operation.Literature review and interpretation.The 5 currently clinically-tested bariatric procedures, ranked from least to ...
openaire +2 more sources
A categorical unification algorithm
1986This is a case study in the design of computer programs based upon the twin themes of abstraction and constructivity. We consider the unification of t e rms-a symbol-manipulative task widely used in computa t ion-and derive a unification algorithm based upon constructions in category theory. This hinges on two observations.
Rydeheard, David, Burstall, Rod M
openaire +3 more sources
Magnetic Resonance Imaging, 1992
Multispectral tissue classification using magnetic resonance T1, T2, and rho images may be useful in diagnosing and locating certain pathology. Techniques for generating the T1 images necessary for this classification scheme often require longer data collection and post processing times than are practical.
J, Gong, J P, Hornak
openaire +2 more sources
Multispectral tissue classification using magnetic resonance T1, T2, and rho images may be useful in diagnosing and locating certain pathology. Techniques for generating the T1 images necessary for this classification scheme often require longer data collection and post processing times than are practical.
J, Gong, J P, Hornak
openaire +2 more sources
A Lexicographic Optimization Algorithm
Automation and Remote Control, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Journal of the ACM, 1979
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Brown, Mark R., Tarjan, Robert E.
openaire +1 more source
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Brown, Mark R., Tarjan, Robert E.
openaire +1 more source