References
- AhujaRKMagnantiTLOrlinJBNetwork flows: Theory, algorithms, and applications1993
- Aksakalli V, Fishkind DE, Priebe CE and Ye X (2008). The CR Disambiguation Protocol, submitted for publication.
- AndreattaGRomeoLStochastic shortest paths with recourseNetworks19881819320410.1002/net.3230180306
- Baglietto M, Battistelli G, Vitali F and Zoppoli R (2003). Shortest path problems on stochastic graphs: A neuro dynamic programming approach . Proceedings of the 42nd IEEE Conference on Decision and Control pp 6187–6193.
- Bar-Noy A and Schieber B (1991). The Canadian traveller problem . SODA'91: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms pp 261–270.
- Blei DM and Kaelbling LP (1999). Shortest paths in a dynamic uncertain domain. IJCAI Workshop on Adaptive Spatial Representations of Dynamic Environments.
- FishkindDEPriebeCEGilesKSmithLNAksakalliVDisambiguation protocols based on risk simulationIEEE Trans Syst Man & Cybern Part A20073781482310.1109/TSMCA.2007.902634
- OlsonTPangJSPriebeCEA likelihood-MPEC approach to target classificationMath Program Ser A20029613110.1007/s10107-003-0242-8
- PapadimitriouCHYannakakisMShortest paths without a mapTheor Comput Sci19918412715010.1016/0304-3975(91)90263-2
- PiatkoCDPriebeCECowenLJWangIJMcNameePPath planning for mine countermeasures command and controlProceedings of the SPIE2001439483684310.1117/12.445447
- PiatkoCDDiehlCPMcNameePReschCWangIJStochastic search and graph techniques for MCM path planningProceedings of the SPIE2002474258359210.1117/12.479130
- PolychronopoulosGHTsitsiklisJNStochastic shortest path problems with recourseNetworks19962713314310.1002/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L
- PriebeCEOlsonTEHealyDMJrExploiting stochastic partitions for minefield detectionProceedings of the SPIE1997307950851810.1117/12.280879
- Priebe CE, Pang JS and Olson T (1999). Optimizing sensor fusion for classification performance. Proceedings of the CISST '99 International Conference, Las Vegas, Nevada, June 1999, pp 397–403.
- PriebeCENaimanDQCopeLImportance sampling for spatial scan analysis: Computing scan statistic p-values for marked point processesComput Stat Data An200135447548510.1016/S0167-9473(00)00017-7
- PriebeCEFishkindDEAbramsLPiatkoCDRandom disambiguation paths for traversing a mapped hazard fieldNav Res Log20055228529210.1002/nav.20071
- ProvanJSA polynomial-time algorithm to find shortest paths with recourseNetworks20034211512510.1002/net.10063
- Smith DL (1995). Detection technologies for mines and minelike targets. Proceedings of the SPIE: Detection Technologies for Mines and Minelike Targets, Orlando, Florida, April 1995, Vol. 2496, pp 404–408.
- WashburnAMine warfareChapter 10 of Naval Operations Analysis1999
- Witherspoon NH, Holloway JH, Davis KS, Miller RW and Dubey AC (1995). The Coastal Battlefield Reconnaissance and Analysis (COBRA) Program for Minefield Detection. Proceedings of the SPIE: Detection Technologies for Mines and Minelike Targets, Orlando, Florida, April 1995, Vol. 2496, pp 500–508.