Results 41 to 50 of about 1,486,783 (327)
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets [PDF]
, 2011 Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: "which set in I is the most difficult to ...
Gupta, Anupam +2 more
core
Theoretical Computer Science, 2011 6 pages, 1 figure, submitted to Theoretical Computer ...
Ren, Wei, Zhao, Qing
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro +10 more
wiley +1 more source
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
On some covering problems in geometry [PDF]
, 2015 We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally, any measurable ...
Naszódi, Márton
core +4 more sources
The Pipelined Set Cover Problem [PDF]
, 2004 A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the elements covered at each stage are discarded.
Kamesh Munagala +3 more
openaire +1 more source
Design and Optimization of Underground Logistics Transportation Networks
IEEE Access, 2019 With the burden of city transportation system becoming bigger and bigger, it is imperative to develop reliable and efficient underground logistics. The appropriate location of cargo transshipment centers in underground logistics system is selected using ...
Mu Ren +4 more
doaj +1 more source
Binarization of Metaheuristics: Is the Transfer Function Really Important?
Biomimetics, 2023 In this work, an approach is proposed to solve binary combinatorial problems using continuous metaheuristics. It focuses on the importance of binarization in the optimization process, as it can have a significant impact on the performance of the ...
José Lemus-Romani +4 more
doaj +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
On Mathematical Modelling of Automated Coverage Optimization in Wireless 5G and beyond Deployments
Applied Sciences, 2020 The need to optimize the deployment and maintenance costs for service delivery in wireless networks is an essential task for each service provider. The goal of this paper was to optimize the number of service centres (gNodeB) to cover selected customer ...
Pavel Seda, Milos Seda, Jiri Hosek
doaj +1 more source