We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
There is a tremendous amount of web content available today, but it is not always in a form that supports end-users' needs. In many cases, all of the data and services needed...
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computation...
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Pair Programming has often been reported to be beneficial in software projects. To better understand where these benefits come from we evaluate the aspect of intra-pair communica...
Kai Stapel, Eric Knauss, Kurt Schneider, Matthias ...