نتایج جستجو برای: randomly
تعداد نتایج: 138759 فیلتر نتایج به سال:
Waiter-Client games are played on a hypergraph \((X,\mathcal {F})\), where \(\mathcal {F} \subseteq 2^X\) denotes the family of winning sets. During each round, Waiter offers predefined amount (called bias) elements from board X, which Client takes one for himself while rest go to Waiter. wins game if she can force occupy any set \(F \in \mathcal {F}\). In this paper we consider randomly pertur...
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d(v,w1), d(v,w2), . . . , d(v,wk)) is called the (metric) representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respect ...
We have developed a simple and efficient algorithm to identify each member of a large collection of DNA-linked objects through the use of hybridization, and have applied it to the manufacture of randomly assembled arrays of beads in wells. Once the algorithm has been used to determine the identity of each bead, the microarray can be used in a wide variety of applications, including single nucle...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید