An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to...
This paper presents an extension to the ePresence Interactive Media webcasting infrastructure to support real-time voice and video conferencing for a few attendees while concurrent...
Ronald Baecker, Jeremy P. Birnholtz, Rhys Causey, ...
We are working on scheduling of garbage collector as a concurrent thread for time-constrained applications in Common Language Infrastructure (CLI). We have implemented an increment...