Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
Even without possible interference from external radio sources, the problem of guaranteeing quality-of-service (QoS) routing in mobile ad hoc networks (MANETs) is a difficult probl...
— Though modern operating systems have a capable of controlling the power consumption using the DVFS (Dynamic Voltage and Frequency Scaling) mechanism, it is controlled for some ...