✦ LIBER ✦

Some generalizations of the T-method in simultaneous inference

✍ Scribed by Yosef Hochberg

Book ID: 107880014
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 530 KB
Volume: 4
Category: Article
ISSN: 0047-259X
DOI: 10.1016/0047-259x(74)90015-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some generalizations of the Newton-Kanto

Some generalizations of the Newton-Kantorovich method

✍ N. S. Kurpel'; F. M. Migovich 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 639 KB

On some generalizations of the factoriza

On some generalizations of the factorization method

✍ I. Z. Golubchik; V. V. Sokolov 📂 Article 📅 1997 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 495 KB

Some generalizations on the method of su

Some generalizations on the method of superposed epoch analysis

✍ J.C. Samson; K.L. Yeung 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 973 KB

Some generalizations of the contraction

Some generalizations of the contraction mapping theorem

✍ B. T. Sims 📂 Article 📅 1972 🏛 Springer Milan 🌐 Italian ⚖ 270 KB

Some generalizations of the criss-cross

Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids

✍ E. Klafszky; T. Terlaky 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 562 KB

Some generalizations of the steiner prob

Some generalizations of the steiner problem in graphs

✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning