Results 21 to 30 of about 2,902,197 (338)
Computing Minimum-Weight Perfect Matchings [PDF]
INFORMS Journal on Computing, 1999 We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes.
Cook, William, Rohe, André
openaire +2 more sources
Finding the Minimum-Weight k-Path [PDF]
, 2013 Given a weighted $n$-vertex graph $G$ with integer edge-weights taken from a range $[-M,M]$, we show that the minimum-weight simple path visiting $k$ vertices can be found in time $\tilde{O}(2^k \poly(k) M n^\omega) = O^*(2^k M)$.
B. Monien +8 more
core +1 more source
Boneless yield of carcass of feedlot-finished young Bos indicus L. bulls
Acta Agronómica, 2018 The aim of this study was to evaluate the boneless yield of the carcass of 64 feedlot-finished young Nellore bulls fed diets containing coated or uncoated urea and slaughtered at five body weights (350, 455, 485, 555, and 580 kg). A completely randomized
Raul Dirceu-Pazdiora +6 more
doaj +1 more source
Application of an Efficient Gradient-Based Optimization Strategy for Aircraft Wing Structures
Aerospace, 2018 In this paper, a practical optimization framework and enhanced strategy within an industrial setting are proposed for solving large-scale structural optimization problems in aerospace.
Odeh Dababneh +2 more
doaj +1 more source
Fast and Deterministic Approximations for k-Cut [PDF]
, 2018 In an undirected graph, a k-cut is a set of edges whose removal breaks the graph into at least k connected components. The minimum weight k-cut can be computed in n^O(k) time, but when k is treated as part of the input, computing the minimum weight k-cut
Quanrud, Kent
core +2 more sources
Improved Memetic Algorithm for Solving the Minimum Weight Vertex Independent Dominating Set
Mathematics, 2020 The minimum weight vertex independent dominating set (MWVIDS) problem is an important version of the minimum independent dominating set. The MWVIDS problem has a number of applications in many fields.
Yupeng Zhou +5 more
doaj +1 more source
Scientific Opinion on the essential composition of total diet replacements for weight control [PDF]
EFSA Journal, 2015 Following a request from the European Commission, the EFSA Panel on Dietetic Products, Nutrition and Allergies (NDA) was asked to deliver a scientific opinion on the essential composition of total diet replacements for weight control.
EFSA Panel on Dietetic Products, Nutrition and Allergies (NDA)
doaj +1 more source
Minimum-weight triangulation is NP-hard [PDF]
, 2006 A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge lengths.
Bern M. W. +13 more
core +10 more sources
BMC Surgery, 2023 Background Parathyroidectomy (PTX), an effective treatment for refractory secondary hyperparathyroidism (SHPT) in chronic kidney disease (CKD) patients, still has a high persistent rate. This study aimed to analyze the predictive value of characteristics
Yaoyu Huang +5 more
doaj +1 more source
Minimum variance beamformer weights revisited
NeuroImage, 2015 Adaptive minimum variance beamformers are widely used analysis tools in MEG and EEG. When the target brain activity presents in the form of spatially localized responses, the procedure usually involves two steps. First, positions and orientations of the sources of interest are determined.
Alexander, Moiseev +3 more
openaire +2 more sources