Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
With the increasing storage capacity of personal computing devices, the problems of information overload and information fragmentation become apparent on users’ desktops. For the...
Scientific workflows are a powerful programming technique for specifying complex computations using a number of otherwise independent components. When used in a Grid environment, ...
Distributed multiuser hypermedia environments provide not only information sharing mechanisms but also user collaboration/ communication facilities. The provision of integrated vi...