Title

Construction of (v,k,[lambda])-configurations using a Nonenumerative Search Technique

Author

Donald Philip Shaver, Syracuse University

Date of Award

1973

Degree Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Electrical Engineering and Computer Science

Advisor(s)

Luther D. Rudolph

Keywords

Computer science, combinatorial configurations, symmetrical balanced incomplete block design, heuristic searching, backtrack searching, hill-climbing searching

Subject Categories

Theory and Algorithms

Abstract

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.

Access

Surface provides description only. Full text is available to ProQuest subscribers. Ask your Librarian for assistance.

Recommended Citation

Shaver, Donald Philip, "Construction of (v,k,[lambda])-configurations using a Nonenumerative Search Technique" (1973). Electrical Engineering and Computer Science - Dissertations. 257.
https://surface.syr.edu/eecs_etd/257

http://libezproxy.syr.edu/login?url=http://proquest.umi.com/pqdweb?did=760373821&sid=1&Fmt=7&clientId=3739&RQT=309&VName=PQD