NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 1,876 to 1,890 of 2,855 results Save | Export
Peer reviewed Peer reviewed
Olson, Melfried; Olson, Judith – School Science and Mathematics, 1988
Describes a pattern which emerged from an examination of the digits of the squares of numbers. Provides eight examples having the pattern at the units or tens digit of the number. (YP)
Descriptors: Algorithms, Arithmetic, Elementary Education, Elementary School Mathematics
Peer reviewed Peer reviewed
Bohannon, Barbara; Michaels, Aileen – AMATYC Review, 1990
Provides four examples for testing the validity of logical arguments by using the method of truth trees. (YP)
Descriptors: Algorithms, College Mathematics, Higher Education, Logic
Peer reviewed Peer reviewed
Evered, Lisa – Arithmetic Teacher, 1989
Outlines various subtraction methods, such as the decomposition method, equal-addends method, and low-stress algorithm. Describes a subtraction method by addition of complements. Discusses the advantages and disadvantages of the method. (YP)
Descriptors: Algorithms, Arithmetic, Computers, Elementary School Mathematics
Garden, Dennis; Liebermann, Jack – School Business Affairs, 1989
The application of operations research and computers is providing school bus routing and scheduling to five California counties. Illustrates the system requirements, steps for computerized calculations, a sample bus assignment report, and three data files. (MLF)
Descriptors: Algorithms, Computer Simulation, Elementary Secondary Education, Operations Research
Peer reviewed Peer reviewed
Pizarro, Antonio – Mathematics Teacher, 1989
Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Software
Peer reviewed Peer reviewed
Millsap, Roger E.; Meredith, William – Psychometrika, 1988
An extension of component analysis to longitudinal or cross-sectional data is presented. Components are derived under the restriction of invariant and/or stationary compositing weights. Multiple occasion and multiple group analyses, the computing algorithm, component pattern and structure matrices, and an example are discussed. (TJH)
Descriptors: Algorithms, Componential Analysis, Cross Sectional Studies, Longitudinal Studies
Peer reviewed Peer reviewed
Biru, Tesfaye; And Others – Journal of Documentation, 1989
Discusses the effect of including relevance data on the calculation of term discrimination values in bibliographic databases. Algorithms that calculate the ability of index terms to discriminate between relevant and non-relevant documents are described and tested. The results are discussed in terms of the relationship between term frequency and…
Descriptors: Algorithms, Automatic Indexing, Bibliographic Databases, Mathematical Models
Peer reviewed Peer reviewed
Willett, Peter – Information Processing and Management, 1988
Reviews recent research into the use of hierarchic agglomerative clustering methods for document retrieval. The topics discussed include the calculation of interdocument similarities, algorithms used to implement clustering methods on large databases, validity testing of document hierarchies, appropriate search strategies, and other applications…
Descriptors: Algorithms, Bibliometrics, Cluster Analysis, Comparative Analysis
Peer reviewed Peer reviewed
Carroll, David M.; And Others – Journal of the American Society for Information Science, 1988
Describes the use of a highly parallel array processor for pattern matching operations in a bibliographic retrieval system. The discussion covers the hardware and software features of the processor, the pattern matching algorithm used, and the results of experimental tests of the system. (37 references) (Author/CLB)
Descriptors: Algorithms, Automatic Indexing, Bibliographic Databases, Computational Linguistics
Peer reviewed Peer reviewed
Wilcocks, Derek; Sanders, Ian – Computers & Education, 1994
Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Courseware
Peer reviewed Peer reviewed
Jones, Susan; And Others – Journal of the American Society for Information Science, 1995
Discusses the feasibility of building intelligent rule- or weight-based algorithms into general-purpose software for interactive thesaurus navigation. Previous research is surveyed; practical investigations in thesaurus navigation and query enhancement are described; and implications for automatic or intelligent thesaurus navigation are…
Descriptors: Algorithms, Computer Software, Indexing, Information Retrieval
Burns, Marilyn – Phi Delta Kappan, 1994
Call for reforming mathematics teaching has been sounded loudly and strongly. Change from teaching standard algorithms to having children invent their own methods requires major pedagogical shift. Teachers must trust students' inventiveness and ability to make sense of numerical situations, be committed to thinking and reasoning as cornerstone of…
Descriptors: Algorithms, Arithmetic, Creative Thinking, Educational Change
Machovec, George S. – Online Libraries and Microcomputers, 1993
Discusses the development of successful pricing algorithms for cooperative library automation projects. Highlights include desirable characteristics of pricing measures, including simplicity and the ability to allow for system growth; problems with transaction-based systems; and a review of the pricing strategies of seven library consortia.…
Descriptors: Academic Libraries, Algorithms, Consortia, Higher Education
Peer reviewed Peer reviewed
Berger, Martijn P. F. – Applied Psychological Measurement, 1994
This paper focuses on similarities of optimal design of fixed-form tests, adaptive tests, and testlets within the framework of the general theory of optimal designs. A sequential design procedure is proposed that uses these similarities to obtain consistent estimates for the trait level distribution. (SLD)
Descriptors: Achievement Tests, Adaptive Testing, Algorithms, Estimation (Mathematics)
Peer reviewed Peer reviewed
de Leeuw, Jan; Kreft, Ita G. G. – Journal of Educational and Behavioral Statistics, 1995
Practical problems with multilevel techniques are discussed. These problems relate to terminology, computer programs employing different algorithms, and interpretations of the coefficients in either one or two steps. The usefulness of hierarchical linear models (HLMs) in common situations in educational research is explored. While elegant, HLMs…
Descriptors: Algorithms, Computer Software, Definitions, Educational Research
Pages: 1  |  ...  |  122  |  123  |  124  |  125  |  126  |  127  |  128  |  129  |  130  |  ...  |  191