This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Software components o er numerous advantages in terms of development, but may give rise to ine ciency due to highly generic implementations. Program specialization can automatical...
Aspect-Oriented Programming (AOP) has been considered ing abstraction principle to reduce the problem of code tangling and make software structure clean and configurable. This pap...
Network applications and services need to be environment-aware in order to meet non-functional requirements in increasingly dynamic contexts. In this paper we consider partition a...