Abstract. Many previous studies have examined the placement of access points (APs) to improve the community’s understanding of the deployment and behavioral characteristics of wi...
Dongsu Han, David G. Andersen, Michael Kaminsky, K...
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Present-day parallel computers often face the problems of large software Overheadsfor process switching and interprocessor communication. These problems are addressed by the Multi...
Herbert H. J. Hum, Kevin B. Theobald, Guang R. Gao
This paper presents a computing approach, called Palpable Computing, complementing and extending Ambient Computing notions and techniques. The main contribution of this paper lies ...
Giovanni Rimassa, Dominic A. P. Greenwood, Monique...
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...