Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
Moving toward 4G, wireless ad hoc networks receive growing interest due to users’ provisioning of mobility, usability of services, and seamless communications. In ad hoc network...
Qian Zhang, Qing Chen, Fan Yang, Xuemin Shen, Zhis...
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...