New Bounds for Oblivious Mesh Routing 

... queue-size meshes including √ N processors, e.g., an √ O(N 7/8 / k) upper bound for 4D meshes, an O(N 9/10 / k) upper bound for 5D meshes, and so on 3D Oblivious Routing For oblivious routing on ... processors A similar bound also holds for deterministic routing but for random permutations [9], including our new algorithm K Iwama et al., Oblivious Mesh Routing, JGA...

Ngày tải lên: 16/06/2016, 01:35

... Litsyn and A Lobstein: Covering Codes, Elsevier, 1997 [3] M G Karpovsky, K Chakrabarty and L B Levitin: On a new class of codes for identifying vertices in graphs, IEEE Trans Inform Th., vol 44, ... But this identifying code is not optimal Codewords can be deleted without losing the identifying property We obtain the code of figure Hence : Theorem 3.1 The minimum density of an...

Ngày tải lên: 07/08/2014, 06:20

... turn will yield bounds on the size of union-free families the electronic journal of combinatorics (1998), # R39 Weakly Union-Free Upper Bound We consider first weakly union-free families We need ... one of the triplets of B , and we let that triplet take care of the parity condition for B The number of choices for the block, in this case, is 840 × 1519 Summing, the...

Ngày tải lên: 07/08/2014, 06:22

... and A Peterson, Dynamic Equations on Time Scales: An Introduction with Application, Birkh¨ user, Boston, Mass, USA, 2001 a M Bohner and A Peterson, Advances in Dynamic Equations on Time Scales, ... user, Boston, Mass, a USA, 2003 M Bohner, L Erbe, and A Peterson, “Oscillation for nonlinear second order dynamic equations on a time scale,” Journal of Mathematical Analysis and Appl...

Ngày tải lên: 21/06/2014, 20:20

... bounds for the product of two general matrices The new trace bounds improve the recent results Then, for their application in the algebraic Riccati equation, we get some upper and lower bounds ... Journal of Inequalities and Applications Therefore, considering the application of the trace bounds, many scholars pay much attention to estima...

Ngày tải lên: 22/06/2014, 02:20

... Harvesting Some Lower Bounds for Ramsey Numbers It is amazing that the result of this section has not been observed for the 25 years since [C] was published Using this observation we will give new lower ... 87-95 [R] S Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics, Dynamic Survey DS1, 1994, 28pp [S] Song En Min, New Lower Bound Formulas for th...

Ngày tải lên: 07/08/2014, 06:20

... the determination of optimal values and lower bounds for every Hn Besides the trivial cases H3 and H4 , Golberg showed constructions providing lower bounds for n ≤ 15 A.W.M Dress, Yang Lu, Zhang ... Barequet, A lower bound for for Heilbronn s triangle problem in d dimensions SIAM J Discrete Math 14 (2001), no 2, 230–236 [3] C Bertram–Kretzberg, T Hofmeister, and H Lefmann, An...

Ngày tải lên: 07/08/2014, 06:23

... we presented a method to construct lower bounds for Van der Waerden numbers The final results are shown in table Table 4: Known Van der Waerden numbers and known and improved lower bounds r\k 27 ... #R6 2.2 Current bounds of Van der Waerden numbers Only five smaller Van der Waerden numbers are known at present The known Van der Waerden numbers, as...

Ngày tải lên: 07/08/2014, 15:22

... isomorphism properties of generalized Paley graphs In this paper we use this tool to study cyclic graphs of non-prime order and give a new generalization of generalized Paley graphs, which we will ... lower bounds R(3, 3) and R(4, 4) 18 These graphs were Paley graphs, and the same method produced results such like R(6, 6) 102 [6] and R(8, 8) 282 [2] I...

Ngày tải lên: 08/08/2014, 11:20

... establish new bounds for µ(n, d) for small values of the parameters n and d In [15], H Tarnanen uses the conjugacy scheme of the group Sn in order to obtain new upper bounds for the size of a permutation ... while the upper bound obtained by application of Theorem is µ(6, 5, 5) 34 For this reason, the upper bounds not contribute to any improvement...

Ngày tải lên: 08/08/2014, 12:22

... reader that it refers to a set of MVRPD demand points that emanate from the same IRP customer i and that all share the same geographical location Cumulated quantities Given the nature of the inventory ... deterministic and dynamic demand, and have a finite capacity for holding local inventory Holding costs are however considered at the central warehouse, as well as at the...

Ngày tải lên: 16/09/2015, 15:43

Ngày tải lên: 03/10/2012, 15:21

... and RNA synthesis, and inosine that will be degraded into hypoxanthine and xanthine and finally into uric acid Hypoxanthine and guanine may enter in a salvage pathway, using hypoxanthine-guanine ... immunogenicity The PEGylation consists in binding with a covalent link a protein (adenosine-deaminase, asparaginase, interferons, granulocyte colonystimulating factor, liposoma...

Ngày tải lên: 31/10/2012, 14:59

... Personal TRANSFORMATION How to Use Ancient Wisdom to Create a New Life of Success and Happiness For Yourself Dr Tim Ong M.B.B.S Personal TRANSFORMATION How to Use Ancient Wisdom to Create A New ... manifest what they visualised in their lives AFFIRMATIONS Jeff Staniforth, the creator of Sculptor 3, an amazing software that can make affir...

Ngày tải lên: 15/12/2013, 06:15

... Branch # Branch # Minimum cutset No Branch # Branch # Minimum cutset No Branch # Branch # Minimum cutset No Branch # Branch # Minimum cutset No Branch # Branch # Minimum cutset No Branch # Branch ... "Simple Enumeration of Minimal Cutsets Separating Vertices in a Class of Undirected Planar Graphs," IEEE Trans on Reliability, Vol 41, No 1, March 1992...

Ngày tải lên: 03/01/2014, 19:35