Results 31 to 40 of about 2,827,443 (335)
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
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem
IEEE Access, 2021 The minimum weight vertex cover problem (MWVCP) is a fundamental combinatorial optimization problem with various real-world applications. The MWVCP seeks a vertex cover of an undirected graph such that the sum of the weights of the selected vertices is ...
Yang Wang, Zhipeng Lu, Abraham P. Punnen
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
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
The minimum weight t-composition of an integer [PDF]
Journal of Mathematical Sciences, 2012 Let p and t, p ≥ t, be positive integers. A t-composition of p is an ordered t-tuple of positive integers summing p. If T = (s1, s2, . . . , st) is a t-composition p and W is a p − (t − 1) × t matrix, then \( W(T) = \sum\limits_{k = 1}^t {{w_{{s_k}k}}} \) is called the weight of the t-composition T.
Cardoso, D. M., Cerdeira, J. O.
openaire +3 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
Minimum distance and the minimum weight codewords of Schubert codes [PDF]
Finite Fields and Their Applications, 2018 26 pages; Slightly revised version; to appear in Finite Fields ...
Sudhir R. Ghorpade, Prasant Singh
openaire +4 more sources
On minimum integer representations of weighted games [PDF]
Mathematical Social Sciences, 2014 We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the exist at all, are linked with some solution concepts in game theory.
Freixas Bosch, Josep, Kurz, Sascha
openaire +6 more sources
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
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