نتایج جستجو برای: generalized near

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

Journal: :Proceedings of the Edinburgh Mathematical Society 1984

In this paper, we introduce the concept of interval valued fuzzy weak bi-ideals of $Gamma$-near-rings, which is a generalized concept of fuzzy weak bi-ideals of $Gamma$- near-rings. We also characterize some properties and examples of interval valued fuzzy weak bi-ideals of $Gamma$-near-rings.

Journal: :international journal of hospital research 2013
toktam khatibi mohammad mehdi sepehri pejman shadpour

background and objectives: identification of surgical instruments in laparoscopic video images has several biomedical applications. while several methods have been proposed for accurate detection of surgical instruments, the accuracy of these methods is still challenged high complexity of the laparoscopic video images. this paper introduces a surgical instrument detection framework (sidf) for a...

2009
Martin Griffiths

The nth near-Bell number, as defined by Beck, enumerates all possible partitions of an n-multiset with multiplicities 1, 1, 1, . . . , 1, 2. In this paper we study the sequences arising from a generalization of the near-Bell numbers, and provide a method for obtaining both their exponential and their ordinary generating functions. We derive various interesting relationships amongst both the gen...

Journal: :Canadian mathematical bulletin 2023

Abstract We classify braided generalized near-group fusion categories whose global dimension is not an integer; there are exactly two up to Grothendieck equivalence and taking products with pointed categories.

Journal: :International Journal of Mathematics and Mathematical Sciences 2013

Journal: :journal of algorithms and computation 0
s. jabari university of tehran, department of algorithms and computation. dara moazzami university of tehran, college of engineering, faculty of engineering science a. ghodousian university of tehran, college of engineering, faculty of engineering science

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

Journal: :International Journal of Mathematics and Mathematical Sciences 2008

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

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