We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
In this paper we present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory such as Shannon’s Entropy [31]. We...
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
Massimo Paolucci, Daniel D. Suthers, Arlene Weiner