2 research outputs found
An efficient curing policy for epidemics on graphs
We provide a dynamic policy for the rapid containment of a contagion process
modeled as an SIS epidemic on a bounded degree undirected graph with n nodes.
We show that if the budget of curing resources available at each time is
, where is the CutWidth of the graph, and also of order
, then the expected time until the extinction of the epidemic
is of order , which is within a constant factor from optimal, as well
as sublinear in the number of nodes. Furthermore, if the CutWidth increases
only sublinearly with n, a sublinear expected time to extinction is possible
with a sublinearly increasing budget
NASA SERC 1990 Symposium on VLSI Design
This document contains papers presented at the first annual NASA Symposium on VLSI Design. NASA's involvement in this event demonstrates a need for research and development in high performance computing. High performance computing addresses problems faced by the scientific and industrial communities. High performance computing is needed in: (1) real-time manipulation of large data sets; (2) advanced systems control of spacecraft; (3) digital data transmission, error correction, and image compression; and (4) expert system control of spacecraft. Clearly, a valuable technology in meeting these needs is Very Large Scale Integration (VLSI). This conference addresses the following issues in VLSI design: (1) system architectures; (2) electronics; (3) algorithms; and (4) CAD tools