We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
In this paper, we report on users' revisitation patterns to World Wide Web (WWW) pages, and use the results to lay an empirical foundation for the design of history mechanism...
We revisit the automatic tool composition feature of the Electronic Tool Integration platform under the perspective of planning. It turns out that in todays terminology, ETIs temp...