In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
When using the computer, each user has some notion that "these applications are important" at a given point in time. We term this subset of applications that the user va...
Joshua M. Hailpern, Nicholas Jitkoff, Joseph Subid...
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Resource sharing can cause unfair and unpredictable performance of concurrently executing applications in Chip-Multiprocessors (CMP). The shared last-level cache is one of the mos...