Some asymptotically optimal one-sided embeddings of trees of similar formulas into rectangular lattices

2017 ◽  
Vol 41 (2) ◽  
pp. 89-96
Author(s):  
S. A. Lozhkin ◽  
L. I. Vysotsky
Keyword(s):  
Asymptotically Optimal ◽  
Rectangular Lattices

Block designs for variety trials

1978 ◽  
Vol 90 (2) ◽  
pp. 395-400 ◽  
Author(s):  
H. D. Patterson ◽  
E. R. Williams ◽  
E. A. Hunter
Keyword(s):  
Block Designs ◽  
Incomplete Block ◽  
Variety Trials ◽  
Rectangular Lattices

SummaryIn this paper we present a series of resolvable incomplete block designs suitable for variety trials with any number of varieties v in the range 20 ≤v ≤ 100. These designs usefully supplement existing square and rectangular lattices. They are not necessarily optimal in the sense of having smallest possible variances but their efficiencies are known to be high.

scholarly journals Asymptotically optimal cubature formulas on manifolds for prefixed weights

2021 ◽  
pp. 105632
Author(s):  
Martin Ehler ◽  
Ujué Etayo ◽  
Bianca Gariboldi ◽  
Giacomo Gigante ◽  
Thomas Peter
Keyword(s):  
Asymptotically Optimal ◽  
Cubature Formulas

Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes

2012 ◽  
Vol 58 (2) ◽  
pp. 1163-1185 ◽  
Author(s):  
Reza Omrani ◽  
Gagan Garg ◽  
P. Vijay Kumar ◽  
Petros Elia ◽  
Pankaj Bhambhani
Keyword(s):  
Two Dimensional ◽  
Asymptotically Optimal ◽  
Optical Orthogonal Codes ◽  
Orthogonal Codes ◽  
Large Families

ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION

1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ
Keyword(s):  
Lower Bounds ◽  
Wide Class ◽  
Time Complexity ◽  
Upper And Lower Bounds ◽  
Average Case ◽  
Asymptotically Optimal ◽  
Circuit Delay ◽  
Suitable Measure

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.

An asymptotically optimal greedy algorithm for large optical burst switching systems

2003 ◽  
Vol 31 (2) ◽  
pp. 14-16 ◽  
Author(s):  
Lachlan L. H. Andrew ◽  
Yuliy Baryshnikov ◽  
E. G. Coffman ◽  
Stephen V. Hanly ◽  
Jolyon White
Keyword(s):  
Greedy Algorithm ◽  
Optical Burst Switching ◽  
Switching Systems ◽  
Asymptotically Optimal ◽  
Burst Switching ◽  
Optical Burst
Sign in / Sign up

Export Citation Format

Share Document