This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to aâ€¦ (More)

We consider two fundamental problems in dynamic scheduling: scheduling to meet deadlines in a preemptive multiprocessor setting, and scheduling to provide good response time in a number of schedulingâ€¦ (More)

A capacitatedcovering IP is an integer program of the form , whereall entriesof , , and arenonnegative. Givensucha formulation,theratiobetween the optimal integer solutionandthe optimal solutiontoâ€¦ (More)

A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobsâ€¦ (More)

We consider the problem of nding near-optimal solutions for a variety of NP-hard scheduling problems for which the objective is to minimize the total weighted completion time. Recent work has led toâ€¦ (More)

We present a model for optimizing the placement of sensors in municipal water networks to detect maliciously-injected contaminants. An optimal sensor configuration minimizes the expected fraction ofâ€¦ (More)

Given a graph G = (V, E) where each vertex v E V is assigned a weight w(v) and each edge e E E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and S is c(S,â€¦ (More)

Inferring the consensus of a set of different evolutionary trees for a given species set is a well-studied problem, for which several different models have been proposed. In this paper, we propose aâ€¦ (More)