Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The under...
Peter Muth, Patrick E. O'Neil, Achim Pick, Gerhard...
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
Mark de Berg, Matthew J. Katz, A. Frank van der St...
The InfoPad project was started at UC Berkeley in 1992 to investigate the issues involved in providing multimedia information access using a portable, wireless terminal. It quickl...