Results 11 to 20 of about 792,002 (266)
Kernel Partial Least Squares Feature Selection Based on Maximum Weight Minimum Redundancy
Entropy, 2023 Feature selection refers to a vital function in machine learning and data mining. The maximum weight minimum redundancy feature selection method not only considers the importance of features but also reduces the redundancy among features.
Xiling Liu, Shuisheng Zhou
doaj +1 more source
Energies, 2020 Through applying an exemplary design study, the dependencies between current density, temperatures, and weight in an electrical drive system for a small range aircraft with conventional electrical fan or propeller drives are evaluated. This study applies
Jan Hoffmann +2 more
doaj +1 more source
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
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
Minimum Weight Flat Antichains of Subsets [PDF]
Order, 2021 Building on classical theorems of Sperner and Kruskal-Katona, we investigate antichains $\mathcal F$ in the Boolean lattice $B_n$ of all subsets of $[n]:=\{1,2,\dots,n\}$, where $\mathcal F$ is flat, meaning that it contains sets of at most two consecutive sizes, say $\mathcal F=\mathcal{A}\cup\mathcal{B}$, where $\mathcal{A}$ contains only $k$-subsets,
Griggs, Jerrold R. +4 more
openaire +2 more sources
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
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 Edge Discriminators in Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2014 In this paper we introduce the notion of minimum-weight edge-discriminators in hypergraphs, and study their various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathscr E)$, a function $\lambda: \mathcal V\rightarrow \mathbb Z^{+}\cup\{0\}$ is said to be an edge-discriminator on $\mathcal H$ if $\sum_{v\in E_i}{\lambda(v)}>0$, for all ...
Bhattacharya, Bhaswar B +2 more
openaire +4 more sources