An experiment on CAI sequencing constructs /

Includes bibliographical references.

The use of computers in literature searching and related reference activities in libraries : papers presented at the 1975 Clinic on Library Applications of Data Processing, April 27-30, 1975 /

Includes bibliographical references.

Effects of method of error interruption on student performance at interactive terminals /

Originally presented as the author's thesis (M.A.), University of Illinois at Urbana-Champaign.

GUIDE-O; an experimental information system /

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Data collection as an improvement technique for PLATO lessons /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Details of an experimental videotape evaluation of an interactive exam system /

Mode of access: Internet.

An interactive compile-time diagnostic system /

Thesis--University of Illinois at Urbana-Champaign.

Experimental and formal language design applied to control constructs for interactive computing /

Vita.

A videotape analysis of student performance on an interactive examination /

Bibliography: p. 52.

Fiscal year ... advanced technology equipment matching grant report /

Description based on: 1985; title from caption.

Guidelines for air quality maintenance planning and analysis.

Vol. 7: second ed., 1975.

Heat stress, heat strain, and productivity in Washington State tree fruit harvesters

Thesis (Master's)--University of Washington, 2016-06

Erectile Dysfunction Drug Use, Risk Behavior, and Sexually Transmitted Diseases

Thesis (Master's)--University of Washington, 2016-06

Constructing and evaluating alternative prediction models for identifying clinically relevant cases in an STD clinic

Thesis (Master's)--University of Washington, 2016-06

Breadth-first search and the Andrews-Curtis conjecture

Andrews and Curtis conjectured in 1965 that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. Recent computational work by Miasnikov and Myasnikov on this problem has been based on genetic algorithms. We show that a computational attack based on a breadth-first search of the tree of equivalent presentations is also viable, and seems to outperform that based on genetic algorithms. It allows us to extract shorter proofs (in some cases, provably shortest) and to consider the length thirteen case for two generators. We prove that, up to equivalence, there is a unique minimum potential counterexample.