✦ LIBER ✦

A Note on the comparison of five heuristic optimization techniques of a certain class of decision trees

✍ Scribed by Nicholas V. Findler; Timothy W. Bickmore; Laurie H. Ihrig; Wai-Wan Tsang

Book ID: 107766532
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 660 KB
Volume: 53
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(91)90059-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the optimization of a certain class o

On the optimization of a certain class of magnetoelectrolytic reactors

✍ Thomas Z. Fahidy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 279 KB

A note on the relationship of interdepen

A note on the relationship of interdependent action to the optimality of certain voting decisions

✍ Louis Putterman 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 436 KB

A note on the finiteness of certain cusp

A note on the finiteness of certain cuspidal divisor class groups

✍ Ernst-Ulrich Gekeler 📂 Article 📅 2000 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 547 KB

On the functional optimization of a cert

On the functional optimization of a certain class of nonstationary spatial functions

✍ G. Christakos; P. N. Paraskevopoulos 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 971 KB

A note on the orthogonal basis of a cert

A note on the orthogonal basis of a certain full symmetry class of tensors

✍ C. Bessenrodt; M.R. Pournaki; A. Reifegerste 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 88 KB

It is shown that the full symmetry class of tensors associated with the irreducible character [2, 1 n-2 ] of S n does not have an orthogonal basis consisting of decomposable symmetrized tensors.

A note on the cardinality of certain cla

A note on the cardinality of certain classes of unlabeled multipartite tournaments

✍ Gregory Gutin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are obtained of the numbers of unlabeled acyclic and unicyclic multipartite tournaments, and unlabeled bipartite tournaments with exactly k cycles, which are pairwise vertex-disjoint.