NotesFAQContact Us
Collection
Advanced
Search Tips
What Works Clearinghouse Rating
Showing 1,561 to 1,575 of 2,843 results Save | Export
Peer reviewed Peer reviewed
Archer, J. Andrew – Mathematics Teacher, 1980
An algorithm for multiplying natural numbers is described. The algorithm provides a chance for some unusual drill and might serve as an enrichment topic. (MK)
Descriptors: Algorithms, Mathematical Enrichment, Mathematical Formulas, Mathematics Instruction
Hadar, Nitsa – Mathematics Teaching, 1979
Suggestions for teaching the concept of division by zero are given. (MK)
Descriptors: Algorithms, Division, Elementary Secondary Education, Mathematical Concepts
Mathematics Teaching, 1980
Four different types of problems from graph theory are presented and discussed. (MK)
Descriptors: Algorithms, Graphs, Higher Education, Mathematical Applications
Peer reviewed Peer reviewed
Fennell, F. M. – School Science and Mathematics, 1977
Suggestions are given for teaching flowcharting at the elementary school level. A short list of sources for free materials on computers is included. (DT)
Descriptors: Algorithms, Computers, Elementary School Mathematics, Elementary Secondary Education
Peer reviewed Peer reviewed
Ross, Susan; Pratt-Cotter, Mary – Mathematics Educator, 1997
Reviews the historical development of subtraction algorithms used in the United States. Indicates that the algorithms used to teach subtraction have not changed much in the last 40 years, but in the late 1800s and early 1900s, different algorithms were developed that had a great impact. Contains 22 references. (DDR)
Descriptors: Algorithms, Arithmetic, Concept Formation, Elementary Education
Peer reviewed Peer reviewed
Cawley, John F.; And Others – Learning Disabilities Research and Practice, 1996
Comparison of the computation ability in addition, subtraction, multiplication, and division of 155 students (ages 9-14) with learning disabilities (LD) and 266 normally achieving (NA) students demonstrated that NA students outperformed students with LD. Students with LD had more algorithmic errors, and failed to show growth patterns by age. NA…
Descriptors: Algorithms, Computation, Developmental Stages, Elementary Secondary Education
Peer reviewed Peer reviewed
Tamine, Lynda; Chrisment, Claude; Boughanem, Mohand – Information Processing & Management, 2003
Explains the use of genetic algorithms to combine results from multiple query evaluations to improve relevance in information retrieval. Discusses niching techniques, relevance feedback techniques, and evolution heuristics, and compares retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation…
Descriptors: Algorithms, Comparative Analysis, Evolution, Genetics
Peer reviewed Peer reviewed
Kiers, Henk A. L. – Psychometrika, 1997
A general approach for fitting a model to a data matrix by weighted least squares (WLS) is studied. The approach consists of iteratively performing steps of existing algorithms for ordinary least squares fitting of the same model and is based on maximizing a function that majorizes WLS loss function. (Author/SLD)
Descriptors: Algorithms, Goodness of Fit, Least Squares Statistics, Mathematical Models
Peer reviewed Peer reviewed
Hutchinson, J. Wesley; Mungale, Amitabh – Psychometrika, 1997
A nonmetric algorithm, pairwise partitioning, is developed to identify feature-based similarity structures. Presents theorems about the validity of the features identified by the algorithm, and reports results of Monte Carlo simulations that estimate the probabilities of identifying valid features for different feature structures and amounts of…
Descriptors: Algorithms, Error of Measurement, Estimation (Mathematics), Identification
Peer reviewed Peer reviewed
Anghileri, Julia; Beishuizen, Meindert; Van Putten, Kees – Educational Studies in Mathematics, 2002
Explores written calculation methods for division used by pupils in England (n=276) and the Netherlands (n=259). Analyses informal strategies and identifies progression towards more structured procedures that result from different teaching approaches. Comparison of methods used shows greater success in the Dutch approach which is based on…
Descriptors: Algorithms, Arithmetic, Cognitive Processes, Division
Peer reviewed Peer reviewed
Thelwall, Mike – Online Information Review, 2002
Discusses subject gateway sites and commercial search engines for the Web and presents an explanation of Google's PageRank algorithm. The principle question addressed is the conditions under which a gateway site will increase the likelihood that a target page is found in search engines. (LRW)
Descriptors: Algorithms, Gateway Systems, Search Engines, Search Strategies
Peer reviewed Peer reviewed
Gorbunov, Andrey L. – Journal of the American Society for Information Science and Technology, 2002
Discusses how to improve the quality of Internet search systems and introduces the Ghosts Consensus Method which is free from the drawbacks of digital democracy algorithms and is based on linear programming tasks. Highlights include vector space models; determining relevant documents; and enriching query terms. (LRW)
Descriptors: Algorithms, Internet, Linear Programming, Mathematical Formulas
Peer reviewed Peer reviewed
Kiers, Henk A. L. – Psychometrika, 1989
An alternating least squares algorithm is offered for fitting the DEcomposition into DIrectional COMponents (DEDICOM) model for representing asymmetric relations among a set of objects via a set of coordinates for the objects on a limited number of dimensions. An algorithm is presented for fitting the IDIOSCAL model in the least squares sense.…
Descriptors: Algorithms, Estimation (Mathematics), Goodness of Fit, Least Squares Statistics
Peer reviewed Peer reviewed
Plett, Stephen – AMATYC Review, 1989
Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)
Descriptors: Algorithms, College Mathematics, Equations (Mathematics), Higher Education
Peer reviewed Peer reviewed
Fay, Temple H.; Miller, H. Vincent – Mathematics and Computer Education, 1990
Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)
Descriptors: Algebra, Algorithms, College Mathematics, Higher Education
Pages: 1  |  ...  |  101  |  102  |  103  |  104  |  105  |  106  |  107  |  108  |  109  |  ...  |  190