We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
High-dimensional mixed-attribute data clustering has become an important research direction in data mining area. Because of the advantages of the information technology, data coll...
In this paper, we propose an algorithm, which allocates the bandwidth in an effective manner for sensitive applications. The main idea of this work is to allocate more amount of b...
G. Varaprasad, R. S. D. Wahida Banu, Pallapa Venka...
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...