OPTIMAL BINARY IDENTIFICATION PROCEDURES

[1] ON VARIOUS VERSIONS OF DEFECTIVE COIN PROBLEM [J]. INFORMATION AND CONTROL, 1961, 4 (2-3): : 118 - &

[2] Bellman R.E, 1957, DYNAMIC PROGRAMMING

[3] BUTTERWORTH RW, 1969, THESIS U CALIFORNIA

[4] BALANCE SCALE SORTING [J]. AMERICAN MATHEMATICAL MONTHLY, 1963, 70 (02) : 136 - &

[5] CRANE GE, THESIS STANFORD U

[6] DUNCAN GT, 1970, THESIS U MINNESOTA

[7] OPTIMUM SEARCH ROUTINES FOR AUTOMATIC FAULT LOCATION [J]. OPERATIONS RESEARCH, 1960, 8 (04) : 512 - 523

[8] GAREY MR, 1970, THESIS U WISCONSIN

[9] GAREY MR, TO BE PUBLISHED

[10] AN OPTIMUM POLICY FOR DETECTING A FAULT IN A COMPLEX SYSTEM [J]. OPERATIONS RESEARCH, 1959, 7 (04) : 468 - 477

[1] ON VARIOUS VERSIONS OF DEFECTIVE COIN PROBLEM [J]. INFORMATION AND CONTROL, 1961, 4 (2-3): : 118 - &

[2] Bellman R.E, 1957, DYNAMIC PROGRAMMING

[3] BUTTERWORTH RW, 1969, THESIS U CALIFORNIA

[4] BALANCE SCALE SORTING [J]. AMERICAN MATHEMATICAL MONTHLY, 1963, 70 (02) : 136 - &

[5] CRANE GE, THESIS STANFORD U

[6] DUNCAN GT, 1970, THESIS U MINNESOTA

[7] OPTIMUM SEARCH ROUTINES FOR AUTOMATIC FAULT LOCATION [J]. OPERATIONS RESEARCH, 1960, 8 (04) : 512 - 523

[8] GAREY MR, 1970, THESIS U WISCONSIN

[9] GAREY MR, TO BE PUBLISHED

[10] AN OPTIMUM POLICY FOR DETECTING A FAULT IN A COMPLEX SYSTEM [J]. OPERATIONS RESEARCH, 1959, 7 (04) : 468 - 477