The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
Object oriented languages, in particular Java, use a frequent dynamic dispatch mechanism to search for the definition of an invoked method. A method could be defined in more than...
Mourad Debbabi, M. M. Erhioui, Lamia Ketari, Nadia...
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
There have been many recent research efforts on temporal databases for managing current and historical data and on active databases for monitoring real-world events as well as dat...
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...