Construction of (v,k,[lambda])-configurations using a Nonenumerative Search Technique
Date of Award
Doctor of Philosophy (PhD)
Electrical Engineering and Computer Science
Luther D. Rudolph
Computer science, combinatorial configurations, symmetrical balanced incomplete block design, heuristic searching, backtrack searching, hill-climbing searching
Theory and Algorithms
The existence of certain classes of combinatorial configurations has been in doubt for decades. With the advent of the modern computer, a small number of these configurations have been constructed using exhaustive search techniques. Even with the major advances in computer technology, only a new more cases could be solved using traditional methods. In this paper, a new approach to the construction of these configurations using nonenumerative search techniques is introduced.
Surface provides description only. Full text is available to ProQuest subscribers. Ask your Librarian for assistance.
Shaver, Donald Philip, "Construction of (v,k,[lambda])-configurations using a Nonenumerative Search Technique" (1973). Electrical Engineering and Computer Science - Dissertations. 257.