Most space-sharing resources presently operated by high performance computing centers employ some sort of batch queueing system to manage resource allocation to multiple users. In...
We propose a method of using clustering techniques to partition a set of orders. We define the term order as a sequence of objects that are sorted according to some property, such...
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...
The DASHER Project at USC/ISI has focused upon helping organizations with rapid-response mission requirements by providing information analysis tools that help make sense of sets o...
Ke-Thia Yao, Robert Neches, In-Young Ko, Ragy Elei...
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...