An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
—In this paper, the performance of dynamic multi-swarm particle swarm optimizer (DMS-PSO) on the set of benchmark functions provided for the CEC2008 Special Session on Large Scal...
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...