As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
Andreas Haeberlen, Jochen Liedtke, Yoonho Park, La...
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2 time, Omn space algorithm to nd portions of the text" T which are similar in sh...
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
Daniel E. Neiman, David W. Hildum, Victor R. Lesse...
Today's advanced CASE tools, combining the building-block and generative approaches to software reuse, are effective for reuse of software components and procedures in the pr...