Results 151 to 160 of about 2,772 (191)
Soft BIBD and Product Gradient Codes
IEEE Journal on Selected Areas in Information Theory, 2022 New results in Section III-A and Section IV, references added. Presented in part at the IEEE International Symposiums on Topics in Coding (ISTC) 2021 and in part at the Information-Theoretic Methods for Rigorous, Responsible, and Reliable Machine Learning (ITR3) Workshop in International Conference on Machine Learning (ICML ...
Animesh Sakorikar, Lele Wang
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Communications in Statistics - Simulation and Computation, 2014
The conjecture:“If the case (v,k) = (8, 3) is the only one where the trivial balanced incomplete block design (BIBD) is elementary” is formulated. It is supported by the theorem:TheoremThe conjecture is correct if at least one of the following conditions holds:v 8 if v is prime or a prime power.
D. Rasch, F. Teuscher, L. R. Verdooren
openaire +1 more source
The conjecture:“If the case (v,k) = (8, 3) is the only one where the trivial balanced incomplete block design (BIBD) is elementary” is formulated. It is supported by the theorem:TheoremThe conjecture is correct if at least one of the following conditions holds:v 8 if v is prime or a prime power.
D. Rasch, F. Teuscher, L. R. Verdooren
openaire +1 more source
Discrete Mathematics, 1989 This paper is an addition to \textit{H. Hanani} [Balanced incomplete block designs and related designs, Discrete Math. 11, 255-269 (1975; Zbl 0361.62067)] and uses the numbering system from the preceding paper. The author proves that the obvious necessary conditions for the existence of a BIBD with \(k=7\) and \(\lambda =3\) and 21 are sufficient, with
exaly +2 more sources
[1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers, 2003
The use of multiple buses can improve both the fault tolerance and performance of local area computer networks. Existing schemes either depend on active components for full connectivity or can experience decreased performance as many hosts attempt to access one bus. An architecture class based on balanced incomplete block designs (BIBDs) is proposed to
Bryan Eric Aupperle, John F. Meyer
openaire +1 more source
The use of multiple buses can improve both the fault tolerance and performance of local area computer networks. Existing schemes either depend on active components for full connectivity or can experience decreased performance as many hosts attempt to access one bus. An architecture class based on balanced incomplete block designs (BIBDs) is proposed to
Bryan Eric Aupperle, John F. Meyer
openaire +1 more source
On the E-Optimality of Truncated BIBD
Calcutta Statistical Association Bulletin, 1985It is shown that if some blocks are deleted from a BIBD, then under certain conditions on the parameters, the resulting design is E-optimal.
Sathe, Y. S., Bapat, R. B.
openaire +2 more sources
Modified genetic algorithm for BIBD construction
Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, 2009This paper presents a way of using the natural evolution process as a model for combinatorial design constructions. In spite of the fact that metaheuristic proved its efficiency on a variety of problems, there are only a few known cases of implementing it on combinatorial designs.
Ivica Martinjak, Mario-Osvin Pavcevic
openaire +2 more sources
Properties of superimposed BIBDs
Journal of Statistical Planning and Inference, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A mathematical programming approach to the construction of BIBDs
International Journal of Computer Mathematics, 2011A balanced incomplete block design (BIBD) is instrumental in design of experiments. This is usually constructed by algebraic methods such as finite algebra or difference sets. However, in algebraic approaches, no unified method exists, and each BIBD has been constructed in some ad hoc ways.
Daisuke Yokoya, Takeo Yamada
openaire +1 more source
On symmetric BIBDs with the same 3-concurrence
Designs, Codes and Cryptography, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zongchen Chen, Da Zhao
openaire +1 more source
On the Construction of Bibd With λ = 1
Canadian Mathematical Bulletin, 1973In the past three decades the problem of generating (balanced incomplete block) designs by difference sets has received much attention. Bose [2] gave the two "fundamental theorems of the method of differences". Bose, Sprott [9], Lehmer [7], Chowla [4], Takeuchi [10] and others have given specific classes of difference sets.
openaire +1 more source