نتایج جستجو برای: 2e cvrp
تعداد نتایج: 4235 فیلتر نتایج به سال:
We describe the synthesis, characterization, aqueous behavior, and catalytic activity of a new generation of Fe(III)-TAML (tetraamido macrocycle ligand) activators of peroxides (2), variants of [Fe{(OC)(2)(o,o'-NC(6)H(4)NCO)(2)CMe(2)}(OH(2))(-)] (2d), which have been designed to be especially suitable for purifying water of recalcitrant oxidizable pollutants. Activation of H(2)O(2) by 2 (k(I)) ...
We address a supersaturation problem in the context of forbidden subposets. A family F of sets is said to contain the poset P if there is an injection i : P → F such that p ≤P q implies i(p) ⊂ i(q). The poset on four elements a, b, c, d with a, b ≤ c, d is called a butterfly. The maximum size of a family F ⊆ 2 that does not contain a butterfly is ( n bn/2c ) + ( n bn/2c+1 ) as proved by De Boni...
!" #$% & » 2 5 . 2 &. ./ , .01 2 3"" 40 « ( ) * +" , % !" 56 7 8 97: ;< , & " = >" = :>" 40 68 " ?, @%" 5 a<" 2 ;b/ ./ c8 #7 d > % " 40 cb %" e >, > &b " ?, @%" ".8 > g 8 g7a ? h1>", 8 %" i%8 > % 3" .%" ?,e k ,", 1> n > ,e co8 p $>k 2 @! l< " c0mb .%" e "j % , 2 ?, 2. b7o " 7k s 2 o / .%" ",q r% 0 " " 2 >b> %" ( ) * %" d du 5""," " v% t b0"t " " " ...
A central problem in coding theory is to determine Aq(n, 2e + 1), the maximal cardinality of a q-ary code of length n correcting up to e errors. When e is fixed and n is large, the best upper bound for A(n, 2e+1) (the binary case) is the well-known Johnson bound from 1962. This however simply reduces to the sphere-packing bound if a Steiner system S(e + 1, 2e + 1, n) exists. Despite the fact th...
This article presents techniques for constructing robust Branch-Cutand-Price algorithms on a number of Vehicle Routing Problem variants. The word “robust” stress the effort of controlling the worst-case complexity of the pricing subproblem, keeping it pseudo-polynomial. Besides summarizing older research on the topic, some promising new lines of investigation are also presented, specially the d...
(b) Let PX(1) = p = 1−PX(0). Then I(X∧Y ) = H(Y )−H(Y |X) = h(p2)−p. Differentiation yields that I(X ∧ Y ) is maximized by p = 2e−2 1+e−2 . Hence, the maximizing input pmf on {0, 1} is ( 1−e−2 1+e−2 , 2e−2 1+e−2 ) and C = h ( e−2 1+e−2 ) − 2e−2 1+e−2 bits/channel use. ∗Q2,3,4,6,7 and their solutions are from the Information Theory course taught by Prof. Prakash Narayan at the University of Mary...
Recent studies have identified a Pacific lineage (2E) of JC polyomavirus (also designated as JC virus or JCV) that occurs in both Island Southeast Asia and Oceania, but not in mainland Asia. It has been postulated that this lineage traveled with Austronesian-speaking people who are now spread throughout Island Southeast Asia and Oceania (excluding Australia and inland and southern New Guinea). ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید