The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
This paper presents the framework of a scale-oriented scheme for the presentation and classification of reverse engineered sections of procedural code into objects. The aim is to ...
Aaron J. Quigley, Margot Postema, Heinz W. Schmidt
We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term ...
Rules provide an expressive means for implementing database behavior: They cope with changes and their ramifications. Rules are commonly used for integrity enforcement, i.e., for ...