Experimental analysis of sequential decision making algorithms for port of entry inspection procedures

Authors:
Saket Anand;David Madigan;Richard Mammone;Saumitr Pathak;Fred Roberts
Affiliations:
Rutgers University, Piscataway, NJ;Rutgers University, Piscataway, NJ;Rutgers University, Piscataway, NJ;Rutgers University, Piscataway, NJ;Rutgers University, Piscataway, NJ
Venue:
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Year:
2006

Citing 4
Cited 0

An optimal sequence in multicharacteristics inspection

Journal of Optimization Theory and Applications
Variations on extending partially defined boolean functions with missing bits

Information and Computation
Representing and Solving Decision Problems with Limited Information

Management Science
Logical analysis of binary data with missing bits

Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

Following work of Stroud and Saeger, we investigate the formulation of the port of entry inspection algorithm problem as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on an experimental analysis of the robustness of the conclusions of the Stroud-Saeger analysis and show that the optimal inspection strategy is remarkably insensitive to variations in the parameters needed to apply the Stroud-Saeger method.