Results 1 to 10 of about 2,902,197 (338)

Minimum-Weight Edge Discriminators in Hypergraphs [PDF]

open access: diamondThe 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 ...
Bhaswar B. Bhattacharya   +2 more
core   +7 more sources

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem [PDF]

open access: goldIEEE 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   +2 more sources

Identifying Driver Genomic Alterations in Cancers by Searching Minimum-Weight, Mutually Exclusive Sets. [PDF]

open access: yesPLoS Computational Biology, 2015
An important goal of cancer genomic research is to identify the driving pathways underlying disease mechanisms and the heterogeneity of cancers. It is well known that somatic genome alterations (SGAs) affecting the genes that encode the proteins within a
Songjian Lu   +6 more
doaj   +2 more sources

BATMAN: Fast and Accurate Integration of Single-Cell RNA-Seq Datasets via Minimum-Weight Matching [PDF]

open access: yesiScience, 2020
Summary: Single-cell RNA-sequencing (scRNA-seq) is a set of technologies used to profile gene expression at the level of individual cells. Although the throughput of scRNA-seq experiments is steadily growing in terms of the number of cells, large ...
Igor Mandric   +4 more
doaj   +2 more sources

Algorithm of numerical optimization of steel structures on basis of minimum weight criterion [PDF]

open access: diamondMATEC Web of Conferences, 2018
The description of the algorithm of steel structures optimal design is described in the article. The calculation model is represented by flat and spatial rod elements. The problem of optimization is resolved with the help of mathematical programming. The
Dmitrieva Tatiana
doaj   +2 more sources

Pipelined correlated minimum weight perfect matching of the surface code [PDF]

open access: yesQuantum, 2023
We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events.
Alexandru Paler, Austin G. Fowler
doaj   +1 more source

Minimum weight design of truss structure via force method and Jaya algorithm” [PDF]

open access: yesمهندسی مکانیک شریف, 2021
This research aims to minimize the weight of truss structures using force method formulation as a structural analyzer and Jaya algorithm as an optimizer tool.
A. Barzegari   +2 more
doaj   +1 more source

Application of Self-Adaptive Population Rao Algorithms to Optimization of Steel Grillage Structures

open access: yesComputer Assisted Methods in Engineering and Science, 2023
The self-adaptive population Rao algorithms (SAP-Rao) are employed in this study to produce the optimal designs for steel grillage structures. The size variables in the optimization problem consist of the cross-sectional area of the discrete W-shapes of
Maksym Grzywiński   +2 more
doaj   +1 more source

DESIGN AND STUDY OF DRIVE SWIVEL JOINTS FOR HYDRAULIC MANIPULATION SYSTEMS OF MOBILE TRANSPORT-TECHNOLOGICAL MACHINES [PDF]

open access: yesНаучно-технический вестник Брянского государственного университета, 2018
The paper presents the design and principle of operation of a new type of articulated connection of adjacent links of manipulation systems of mobile transport and technological machines – the drive swivel joints to provide a rotary rela-tive movement of ...
Lagerev A.V., Lagerev I.A.
doaj   +1 more source

Minimum Weight Pseudo-Triangulations [PDF]

open access: yesComputational Geometry, 2004
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S))· log n) which is shown to be asymptotically worst-case optimal, i.e., there exists a point set S for which every pseudotriangulation has ...
Gudmundsson, Joachim   +1 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy