We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
In [23] we presented a partial evaluation scheme for a “real life” subset of Prolog, containing first-order built-in’s, simple side-effects and the operational predicate i...
Despite the automated refactoring support provided by today's IDEs many program transformations that are easy to conceptualize-such as improving the implementation of a desig...
The software engineering community has documented countless success stories where lean and agile software development practices have rescued failing projects and helped countless ...