Results 91 to 100 of about 504,784 (313)
The Minimal Covering Set in Large Tournaments [PDF]
, 2020 We prove that in almost all large tournaments, the minimal covering set is the entire set of alternatives. That is, as the number of alternatives gets large, the probability that the minimal covering set of a uniformly chosen random tournament is the ...
core
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
A Local Branching Approach for the Set Covering Problem
International Journal of Industrial Engineering and Production Research, 2014 The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP.
Masoud Yaghini +2 more
doaj
A high-adaptability nozzle-array printing system based on a set covering printing planning model for printed display manufacturing. [PDF]
Sci Rep, 2023 Wang Y, Chen J, Yin Z, Li Y.
europepmc +1 more source
Computing Tournament Solutions using Relation Algebra and REL VIEW [PDF]
We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and uses the BDD-based computer system RelView for the evaluation of the relation-algebraic expressions that specify the solutions and for the
Rudolf Berghammer +2 more
core
Molecular Oncology, EarlyView.Beyond its role in immune evasion, this study identified that CD47 drives tumor‐intrinsic signaling in non‐small cell lung cancer (NSCLC). Transcriptomic profiling and functional studies revealed that CD47 regulates cell adhesion, migration, and metastasis through an ERK–EMT signaling axis.
Asa P.Y. Lau +8 more
wiley +1 more source
Set Covering: Uses, Algorithms, Results [PDF]
, 1972 An up to date survey of the set covering literature. Applications, (useful) theoretical results, algorithms, computational experience, and existing computer programs are described.
Saha, Jahar, Salkin, Harvey M.
core
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
Discrete Mathematics, 1973 AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinality, and also by the number of elements in S which they cover uniquely.
Thomas M. Hearne, Carl G. Wagner
openaire +1 more source