Learn More
– We consider the problem of searching for immobile friendly entities on an undirected network. The focus is on finding the first such entity. The search time is a random variable, whose probability density function (pdf) depends upon the path and also upon information about entity location. We seek a path choice that minimizes the expected search time.(More)
– The goal of our work is to develop a scalable methodology to a variety of applications requiring data fusion support for decision-making, which has direct applicability to a disaster or homeland security situation. In this work we have considered a dynamic disaster environment where an earthquake has struck and thousands of casualties are to be attended(More)
  • 1