Topic
Minimum weight
About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.
Papers published on a yearly basis
Papers
More filters
25 Jun 2000
TL;DR: The most important parameter of the function of undetected error probability for shortened binary cyclic codes, the number of minimum-weight words, is investigated and a fast method for calculation of A/sub d/ is presented.
Abstract: We investigate the most important parameter of the function of undetected error probability for shortened binary cyclic codes. This parameter is A/sub d/, the number of minimum-weight words. A fast method for calculation of A/sub d/ is presented. Our approach does not require calculation of the distance distribution of dual codes as most of the known methods do.
31 citations
TL;DR: In this paper, the authors present the LBR-5 software for stiffened panels, which is based on the module-oriented optimization (LBR-O) methodology and rational constraints.
31 citations
TL;DR: A previously-suggested concept of multi-objectivization in which a helper objective is introduced in addition to the primary objective of the original single-objective optimization problem (SOOP) is used here.
Abstract: In this article, a customized evolutionary optimization procedure is developed for generating minimum weight compliant mechanisms. A previously-suggested concept of multi-objectivization in which a helper objective is introduced in addition to the primary objective of the original single-objective optimization problem (SOOP) is used here. The helper objective is chosen in a way such that it is in conflict with the primary objective, thereby causing an evolutionary multi-objective optimization algorithm to maintain diversity in its population from one generation to another. The elitist non-dominated sorting genetic algorithm (NSGA-II) is customized with a domain-specific initialization strategy, a domain-specific crossover operator, and a domain-specific solution repairing strategy. To make the search process computationally tractable, the proposed methodology is made suitable for parallel computing. A local search methodology is applied on the evolved non-dominated solutions found by the above-mentioned m...
31 citations
25 Aug 1994
TL;DR: A chain decomposition algorithm is proposed and studied, which proves a property on minimum weight triangulations of points in the Euclidean plane, which shows that a special kind of line segments must be in the minimum weight Triangulations and in the greedy triangulation of a given point set.
Abstract: In this paper, a chain decomposition algorithm is proposed and studied. Using this algorithm, we prove a property on minimum weight triangulations of points in the Euclidean plane, which shows that a special kind of line segments must be in the minimum weight triangulations and in the greedy triangulation of a given point set.
31 citations