The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah