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

Saket Anand, David Madigan, Richard Mammone, Saumitr Pathak, Fred Roberts

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationIntelligence and Security Informatics - IEEE International Conference on Intelligence and Security Informatics, ISI 2006, Proceedings
PublisherSpringer Verlag
Pages319-330
Number of pages12
ISBN (Print)3540344780, 9783540344780
DOIs
StatePublished - 2006
EventIEEE International Conference on Intelligence and Security Informatics, ISI 2006 - San Diego, CA, United States
Duration: May 23 2006May 24 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3975 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherIEEE International Conference on Intelligence and Security Informatics, ISI 2006
Country/TerritoryUnited States
CitySan Diego, CA
Period5/23/065/24/06

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Experimental analysis of sequential decision making algorithms for port of entry inspection procedures'. Together they form a unique fingerprint.

Cite this