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

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

This paper describes the testing of Profiled Steel Sheet Dry Board (PSSDB) load bearing wall system. Experimental tests were conducted on various PSSDB wall samples, with and without infill materials to study its effect on the PSSDB load bearing wall performance. A proprietary profiled steel sheet, Ajiya Cliplock (0.48 mm thick) attached to Cemboard (10 mm thick) on one side, and Cemplank (10 m...

Journal: :European Journal of Combinatorics 2013

Journal: :Journal of Statistical Software 2020

Journal: :Homology, Homotopy and Applications 2009

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...

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

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