Results 31 to 40 of about 1,714,979 (285)
The Angular Set Covering Problem
IEEE AccessWe present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in ...
Fredy Barriga-Gallegos +2 more
doaj +1 more source
Capacitated Multiple Allocation Hub Covering Flow Problem
MANAS: Journal of Engineering, 2021 The aim of the Capacitated Multiple Allocation Hub Covering Flow Problem is to find theoptimal design for hub-and-spoke networks while taking into account hub opening and demandrouting costs.
Orhan Feyzioğlu, Nazmi Sener
doaj
The role and implications of mammalian cellular circadian entrainment
FEBS Letters, EarlyView.At their most fundamental level, mammalian circadian rhythms occur inside every individual cell. To tell the correct time, cells must align (or ‘entrain’) their circadian rhythm to the external environment. In this review, we highlight how cells entrain to the major circadian cues of light, feeding and temperature, and the implications this has for our
Priya Crosby
wiley +1 more source
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility [PDF]
, 2013 We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the ILP Feasibility
Kratsch, Stefan
core +1 more source
The Minimum Substring Cover problem
Information and Computation, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hermelin, Danny +3 more
openaire +5 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
The covering radius problem for sets of perfect matchings
, 2011 Consider the family of all perfect matchings of the complete graph $K_{2n}$ with $2n$ vertices. Given any collection $\mathcal M$ of perfect matchings of size $s$, there exists a maximum number $f(n,x)$ such that if $s\leq f(n,x)$, then there exists a ...
Aw, Alan J., Ku, Cheng Yeaw
core +1 more source
Molecular Oncology, EarlyView.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
Journal of Marine Science and EngineeringIn many applications, including underwater robotics, the coverage problem requires an autonomous vehicle to systematically explore a defined area while minimizing redundancy and avoiding obstacles.
Ahmed Ibrahim +2 more
doaj +1 more source
When is the ball a local pessimum for covering?
, 2014 We consider the problem of identifying the worst point-symmetric shape for covering n-dimensional Euclidean space with lattice translates. Here we focus on the dimensions where the thinnest lattice covering with balls is known and ask whether the ball is
Kallus, Yoav
core +1 more source