نتایج جستجو برای: winner filter
تعداد نتایج: 129109 فیلتر نتایج به سال:
slow sand filters are as a proper technology for pre-treatment of raw water, with a fine and medium trubidity in small communities in developing countries. thus, with a minimum operation cost and minimum need for expest bodies have the maximum efficiency. the purpose of this research is carried out to evaluate the efficiency of two processes of horizontal flow roughing filter and vertical flow ...
There are many different ways to allocate resources in cloud computing. The economic methods are some of common ways to resource allocation. The auction-based method has some advantages compared with Fixed-Price method. The double combinatorial auction is one of the proper ways of resource allocation in cloud computing. Resource allocation in double combinatorial auction includes two phases. Th...
Penalties in judo result from negative actions that are not line with combat regulations. The aim of the research was to determine differences penalties between winner and non-winner competitors judo. A total 1799 (men=1133 women=666) matches were evaluated during 2017, 2018 2019 World Judo Championships. variables expressed as proportions compared Chi-Square test pairwise Z-tests. ratio receiv...
Everybody “knows” that neural networks need more than a single layer of nonlinear units to compute interesting functions. We show that this is false if one employs winner-take-all as nonlinear unit: Any boolean function can be computed by a single -winner-takeall unit applied to weighted sums of the input variables. Any continuous function can be approximated arbitrarily well by a single soft w...
We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely characterized as the only single-winner scoring rule that satisfies the simple majority criterion. We find that, for most of the rules in our new class, the comple...
We study the computational complexity of the counting version of the POSSIBLE-WINNER problem for elections. In the POSSIBLE-WINNER problem we are given a profile of voters, each with a partial preference order, and ask if there are linear extensions of the votes such that a designated candidate wins. We also analyze a special case of POSSIBLE-WINNER, the MANIPULATION problem. We provide polynom...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید