The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
We established an interdisciplinary, intergenerational collaboration in the fall of 1995, between the University of New Mexico's Computer Science Department, the College of E...
Allison Druin, Jason Stewart, David Proft, Benjami...
Parallel direct execution simulation is an important tool for performance and scalability analysis of large message passing parallel programs executing on top of a virtual compute...
Phillip M. Dickens, Matthew Haines, Piyush Mehrotr...
One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achi...
abstract Dzung T. Hoang Philip M. Longy Je rey Scott Vitterz Department of Computer Science Duke University Box 90129 Durham, NC 27708 0129 We compare methods for choosing motion ...
Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitt...