標(biāo)題: Titlebook: Computational and Constructive Design Theory; W. D. Wallis Book 19961st edition Springer Science+Business Media Dordrecht 1996 Morphism.Vo [打印本頁(yè)] 作者: 不幸的你 時(shí)間: 2025-3-21 16:36
書(shū)目名稱Computational and Constructive Design Theory影響因子(影響力)
書(shū)目名稱Computational and Constructive Design Theory影響因子(影響力)學(xué)科排名
書(shū)目名稱Computational and Constructive Design Theory網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Computational and Constructive Design Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Computational and Constructive Design Theory被引頻次
書(shū)目名稱Computational and Constructive Design Theory被引頻次學(xué)科排名
書(shū)目名稱Computational and Constructive Design Theory年度引用
書(shū)目名稱Computational and Constructive Design Theory年度引用學(xué)科排名
書(shū)目名稱Computational and Constructive Design Theory讀者反饋
書(shū)目名稱Computational and Constructive Design Theory讀者反饋學(xué)科排名
作者: Fortify 時(shí)間: 2025-3-21 23:24
of course, the proof of the Four Color Theorem and the proof that there is no projective plane of parameter 10. Although the computer was essential in both proofs, the only reason for this was the fact that life is short. The computations involved were not different in kind from those which have bee作者: 隱士 時(shí)間: 2025-3-22 03:37
Symmetry Breaking in the Standard Models, and it was required that each couple plays against each other couple two or three times. We have used this problem as a vehicle for exploring several techniques of design construction, some of which involve the application of methods more commonly used in continuous optimization problems.作者: 易改變 時(shí)間: 2025-3-22 05:26 作者: 踉蹌 時(shí)間: 2025-3-22 10:15
https://doi.org/10.1007/978-3-319-24566-9 6 and λ = 1 the whole question becomes much more difficult. In the present paper we discuss the work that has been done on this. There are, at present, 55 values of υ for which the existence of such a design is in doubt. We will show how the remaining values of υ are handled.作者: Feature 時(shí)間: 2025-3-22 14:52 作者: Feature 時(shí)間: 2025-3-22 21:05 作者: UTTER 時(shí)間: 2025-3-22 23:00 作者: 入伍儀式 時(shí)間: 2025-3-23 04:35
,BIBDs with , = 6 and λ = 1, 6 and λ = 1 the whole question becomes much more difficult. In the present paper we discuss the work that has been done on this. There are, at present, 55 values of υ for which the existence of such a design is in doubt. We will show how the remaining values of υ are handled.作者: insincerity 時(shí)間: 2025-3-23 07:43
Another Look at Large Sets of Steiner Triple Systems,ber of initial large sets. Each construction is explained, often with the aid of tables of blocks. In the interests of brevity, proofs and complete examples are not given, though the ingredients needed for the construction of the examples are. The recursive constructions are of three types:作者: 閹割 時(shí)間: 2025-3-23 11:48 作者: galley 時(shí)間: 2025-3-23 16:05 作者: poliosis 時(shí)間: 2025-3-23 18:34
Computational Methods in Design Theory, coding and experiment planning theories, network reliability and cryptography. Algorithms for constructive enumeration frequently require searching in high dimensional spaces and employ sophisticated techniques to identify partial (final) solutions. Such methods may be of independent interest in ar作者: 胡言亂語(yǔ) 時(shí)間: 2025-3-24 01:22
Book 19961st editioncessary and sufficient for the existence of a symmetric balanced incomplete block design; the study of this problem has also led to a number of theoretical advances, including investigation of the relationship between codes and designs.作者: STYX 時(shí)間: 2025-3-24 02:50 作者: arousal 時(shí)間: 2025-3-24 07:24
https://doi.org/10.1007/978-1-4612-4074-7 coding and experiment planning theories, network reliability and cryptography. Algorithms for constructive enumeration frequently require searching in high dimensional spaces and employ sophisticated techniques to identify partial (final) solutions. Such methods may be of independent interest in ar作者: EXTOL 時(shí)間: 2025-3-24 14:20
A Bridge Club Design,eting the club was divided into three groups of four couples, and each couple competed against each other couple in its group. The club met eight times, and it was required that each couple plays against each other couple two or three times. We have used this problem as a vehicle for exploring sever作者: escalate 時(shí)間: 2025-3-24 18:09
Computational Methods in Design Theory,ificant area in combinatorial analysis. The object of constructive enumeration consists of creating a complete list of configurations with given properties [5], [8]. There are several reasons which stimulate research in constructive enumeration. Classical methods are not applicable to many interesti作者: 使人煩燥 時(shí)間: 2025-3-24 21:40 作者: 冷峻 時(shí)間: 2025-3-25 01:37 作者: puzzle 時(shí)間: 2025-3-25 04:18
The Nonexistence of 4-(12,6,6) Designs,ory for at most 12 points. We also enumerate three families of related designs, namely the 10977 simple 3-(10, 4, 3) designs, the 67 simple 4-(11, 5, 3) designs, and the 23 simple 5-(12, 6, 3) designs. Finally, we complete the census of all possible partitions of 6-sets on 12 points into 5-(12, 6, A作者: 薄荷醇 時(shí)間: 2025-3-25 08:07 作者: Intruder 時(shí)間: 2025-3-25 14:00
Polyhedral Methods in Design Theory,s and .-designs are emphasized. Classical results and algorithms in polyhedral theory are summarized, integer programming formulation of design construction problems are presented, and polyhedra associated to these formulations and related algorithms are discussed.作者: Solace 時(shí)間: 2025-3-25 19:44
Another Look at Large Sets of Steiner Triple Systems,hough the six cases which were unsettled then have since been solved, and the proof simplified. The proof is by construction, using a fairly small number of initial large sets. Each construction is explained, often with the aid of tables of blocks. In the interests of brevity, proofs and complete ex作者: 令人發(fā)膩 時(shí)間: 2025-3-25 21:34
(22, 33, 12, 8, 4)-BIBD, an Update,such that every element occurs exactly . times and every pair exactly λ times. A (22, 33, 12, 8, 4)-BIBD is the set of parameters with the smallest . for which it is not known whether a BIBD exists or not. A survey of what is known about such a design is given.作者: olfction 時(shí)間: 2025-3-26 03:02
Symmetry Breaking in the Standard Modeleting the club was divided into three groups of four couples, and each couple competed against each other couple in its group. The club met eight times, and it was required that each couple plays against each other couple two or three times. We have used this problem as a vehicle for exploring sever作者: Inoperable 時(shí)間: 2025-3-26 05:02 作者: 抗體 時(shí)間: 2025-3-26 09:39
https://doi.org/10.1007/978-1-4612-4074-7hs, decomposition of a complete graph into smaller complete graphs with difference sets, and the seating of twelve people at three four person tables for multiple nights in an even handed fashion. The paper is intended as a tutorial for someone familiar with design theory but unfamiliar with genetic作者: critique 時(shí)間: 2025-3-26 14:46
https://doi.org/10.1007/978-1-4612-4074-7ansversal designs and incomplete transversal designs..The paper is a record of an attempt to construct tables of the best results implied by known constructions for the existence of certain classes of mutually orthogonal latin squares and incomplete latin squares..Sections §1–6 establish the mathema作者: coalition 時(shí)間: 2025-3-26 18:27
https://doi.org/10.1007/978-3-031-02415-3ory for at most 12 points. We also enumerate three families of related designs, namely the 10977 simple 3-(10, 4, 3) designs, the 67 simple 4-(11, 5, 3) designs, and the 23 simple 5-(12, 6, 3) designs. Finally, we complete the census of all possible partitions of 6-sets on 12 points into 5-(12, 6, A作者: Brain-Waves 時(shí)間: 2025-3-26 21:47 作者: 能得到 時(shí)間: 2025-3-27 03:41
https://doi.org/10.1007/978-3-319-24566-9s and .-designs are emphasized. Classical results and algorithms in polyhedral theory are summarized, integer programming formulation of design construction problems are presented, and polyhedra associated to these formulations and related algorithms are discussed.作者: 進(jìn)取心 時(shí)間: 2025-3-27 08:33 作者: Mendacious 時(shí)間: 2025-3-27 12:45
Symmetry Properties of Moleculessuch that every element occurs exactly . times and every pair exactly λ times. A (22, 33, 12, 8, 4)-BIBD is the set of parameters with the smallest . for which it is not known whether a BIBD exists or not. A survey of what is known about such a design is given.作者: Chagrin 時(shí)間: 2025-3-27 16:52 作者: Mendicant 時(shí)間: 2025-3-27 19:47 作者: caldron 時(shí)間: 2025-3-28 00:55
Symmetry Properties of Moleculessuch that every element occurs exactly . times and every pair exactly λ times. A (22, 33, 12, 8, 4)-BIBD is the set of parameters with the smallest . for which it is not known whether a BIBD exists or not. A survey of what is known about such a design is given.作者: fetter 時(shí)間: 2025-3-28 04:04
https://doi.org/10.1007/978-1-4612-4074-7Searching for a new combinatorial design can be an intimidating task. This paper is a tutorial in the art of discovering designs.作者: Pudendal-Nerve 時(shí)間: 2025-3-28 09:53 作者: evince 時(shí)間: 2025-3-28 12:45
The First Time,Searching for a new combinatorial design can be an intimidating task. This paper is a tutorial in the art of discovering designs.作者: 格言 時(shí)間: 2025-3-28 14:45
On Writing Isomorphism Programs,This is a self-contained exposition on how to write isomorphism programs. It is intended for people who want to write isomorphism programs for combinatorial structures, such as graphs, designs, digraphs, posets, etc.作者: 山間窄路 時(shí)間: 2025-3-28 20:18 作者: 合唱隊(duì) 時(shí)間: 2025-3-28 23:11 作者: 欲望小妹 時(shí)間: 2025-3-29 04:24 作者: Spinous-Process 時(shí)間: 2025-3-29 11:04
Finding Designs with Genetic Algorithms,hs, decomposition of a complete graph into smaller complete graphs with difference sets, and the seating of twelve people at three four person tables for multiple nights in an even handed fashion. The paper is intended as a tutorial for someone familiar with design theory but unfamiliar with genetic algorithms.作者: 詞匯 時(shí)間: 2025-3-29 12:55 作者: Collected 時(shí)間: 2025-3-29 18:16
(22, 33, 12, 8, 4)-BIBD, an Update,such that every element occurs exactly . times and every pair exactly λ times. A (22, 33, 12, 8, 4)-BIBD is the set of parameters with the smallest . for which it is not known whether a BIBD exists or not. A survey of what is known about such a design is given.作者: 慷慨不好 時(shí)間: 2025-3-29 23:30
Berechnung von elastischen Spannungen in beliebig krummlinig berandeten Scheiben und Platten978-3-322-88088-8作者: 不連貫 時(shí)間: 2025-3-30 01:27
https://doi.org/10.1007/978-3-662-05008-8Atoms; Entropy; Ergodic Theory; Local Observables; Mathematical Physics; Quantum Dynamics; Thomas-Fermi Th作者: EXTOL 時(shí)間: 2025-3-30 05:34
