Descriptor
| Algorithms | 3 |
| Mathematical Logic | 3 |
| Mathematical Models | 3 |
| Abstract Reasoning | 1 |
| Algebra | 1 |
| College Mathematics | 1 |
| Computational Linguistics | 1 |
| Computer Programs | 1 |
| Conceptual Schemes | 1 |
| Factor Analysis | 1 |
| Mathematical Applications | 1 |
| More ▼ | |
Publication Type
| Guides - Non-Classroom | 1 |
| Journal Articles | 1 |
| Reports - Descriptive | 1 |
Education Level
Audience
| Practitioners | 1 |
| Teachers | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedHoc, Hoang Hai – Management Science, 1973
Provides a solution method for the problem of finding an optimal traffic network in its simplest form where there are no congestion costs. (Author)
Descriptors: Algorithms, Computational Linguistics, Computer Programs, Mathematical Logic
Peer reviewedBook, Ronald V. – American Mathematical Monthly, 1988
The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)
Descriptors: Abstract Reasoning, Algebra, Algorithms, College Mathematics
Download full textYoung, Forrest W. – 1969
A model permitting construction of algorithms for the polynomial conjoint analysis of similarities is presented. This model, which is based on concepts used in nonmetric scaling, permits one to obtain the best approximate solution. The concepts used to construct nonmetric scaling algorithms are reviewed. Finally, examples of algorithmic models for…
Descriptors: Algorithms, Conceptual Schemes, Factor Analysis, Mathematical Applications
