نتایج جستجو برای: conite subset

تعداد نتایج: 100145  

Journal: :Theoretical Computer Science 1998

Journal: :Algorithmica 2021

Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as subset maximization problems: One is given a ground set $$N=\{1,\dots ,n\}$$ , collection $$\mathcal {F}\subseteq 2^N$$ of subsets thereof such that $$\emptyset \in \mathcal {F}$$ and an objective (profit) function $$p:\mathcal {F}\rightarrow \mathbb {R}_+$$ . The task to choose $$S\in max...

Journal: :Clinical science 1983
G R Corazza P Tabacchi M Frisoni M Londei D Bastia G Gasbarrini

1. As a defect of suppressor function has been hypothesized in the pathogenesis of coeliac disease, we measured, by monoclonal antibodies, the inducer/suppressor T-cell ratio in adult coeliac disease. 2. No statistical difference was observed between coeliac patients and healthy controls, irrespective of treatment and HLA status. 3. These results do not show an imbalance in the inducer/suppress...

Journal: :Oper. Res. Lett. 2015
Sebastian Bervoets Vincent Merlin Gerhard J. Woeginger

We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied vote-swapping parties, the problem is polynomially solvable. For three parties, the problem is NP-complete.

2007
Jerrold R. Griggs

We consider the problem of maximimizing, over all choices of n nonzero elements a 1 ; : : : ; a n 2 R m , the number of the 2 n subset sums P i2I a i , over all index sets I, belonging to some speciied target set T.tigated the case m = 1 and T = f0; 1g of this problem, and showed that the maximum in their case is ? n+1 b n+1 2 c , but it remained open until now to prove the essential uniqueness...

2018
Moses Ganardi Daniel König Markus Lohrey Georg Zetzsche

In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product. On the other hand, the class of knapsack-semilinear groups, where solutions sets of knapsack equations are effectively semilinear, is closed under...

Journal: :FASEB journal : official publication of the Federation of American Societies for Experimental Biology 1995
M G Gonzalez-Haba S Garcia-Mauriño J R Calvo R Goberna J M Guerrero

This paper shows the presence of high-affinity binding sites for melatonin in human circulating T lymphocytes, but not in B lymphocytes. The binding of melatonin to T cells was dependent on time, stable, reversible, saturable, specific, and inversely correlated to the production of melatonin, expressed as the nocturnal 12 h production of its urinary metabolite 6-sulfatoxymelatonin. The affinity...

Journal: :The Journal of clinical investigation 1984
P L Romain S F Schlossman

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید