Results 81 to 90 of about 1,167,396 (296)
Improved Bounds for Online Preemptive Matching [PDF]
, 2012 When designing a preemptive online algorithm for the maximum matching problem, we wish to maintain a valid matching M while edges of the underlying graph are presented one after the other.
Epstein, Leah +3 more
core +4 more sources
The PI3Kδ inhibitor roginolisib (IOA‐244) preserves T‐cell function and activity
Molecular Oncology, EarlyView.Identification of novel PI3K inhibitors with limited immune‐related adverse effects is highly sought after. We found that roginolisib and idelalisib inhibit chronic lymphocytic leukemia (CLL) cells and Treg suppressive functions to similar extents, but roginolisib affects cytotoxic T‐cell function and promotion of pro‐inflammatory T helper subsets to a
Elise Solli +7 more
wiley +1 more source
Revista Investigaciones y Estudios de la UNACorn and bean are fundamental crops for Paraguayan family-based peasant agriculture, yet their production is limited by low soil fertility and the need to optimize light, water, and nutrients.
Armadans Rojas, Andrés José +4 more
doaj +1 more source
Competitive Analysis of Online Kernel Selection in Unified Framework
Jisuanji kexue yu tansuo, 2020 Online kernel selection aims to find the optimal kernel for online kernel learning at each round. It is one of the fundamental and critical problems of online kernel learning.
LIAO Yun, ZHANG Xiao, LIAO Shizhong
doaj +1 more source
Molecular simulation on competitive adsorption characteristics of CH4/O2/N2 gas in lignite
矿业科学学报, 2023 This study intends to explore the influence of temperature and molar ratio on the competitive adsorption of CH4/O2/N2 gas in coal. It probed into the competitive adsorption characteristics of CH4/O2 and N2/O2 binary mixed gas in Xiaolongtan lignite of ...
Zhang Tonghao +5 more
doaj +1 more source
Weighted k-Server Bounds via Combinatorial Dichotomies
, 2017 The weighted $k$-server problem is a natural generalization of the $k$-server problem where each server has a different weight. We consider the problem on uniform metrics, which corresponds to a natural generalization of paging.
Bansal, Nikhil +2 more
core +2 more sources
On the competitive ratio of the work function algorithm for the k-server problem [PDF]
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bartal, Y., Koutsoupias, E.
openaire +5 more sources
A Tight Competitive Ratio for Online Submodular Welfare Maximization
CoRR, 2023 In this paper we consider the online Submodular Welfare (SW) problem. In this problem we are given $n$ bidders each equipped with a general (not necessarily monotone) submodular utility and $m$ items that arrive online. The goal is to assign each item, once it arrives, to a bidder or discard it, while maximizing the sum of utilities.
Ganz, Amit, Nuti, Pranav, Schwartz, Roy
openaire +4 more sources
Molecular Oncology, EarlyView.In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
On Policies for Single-leg Revenue Management with Limited Demand Information
, 2020 In this paper we study the single-item revenue management problem, with no information given about the demand trajectory over time. When the item is sold through accepting/rejecting different fare classes, Ball and Queyranne (2009) have established the ...
Ma, Will +2 more
core +1 more source