Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...