In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
—Due to adverse aqueous environments, non-negligible node mobility and large network scale, localization for large-scale mobile underwater sensor networks is very challenging. In...
Self-adapting systems based on multiple concurrent applications must decide how to allocate scarce resources to applications and how to set the quality parameters of each applicat...
Vahe Poladian, David Garlan, Mary Shaw, M. Satyana...
Reasoning about agents that we observe in the world is challenging. Our available information is often limited to observations of the agent’s external behavior in the past and p...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...
Contextual integrity is a conceptual framework for understanding privacy expectations and their implications developed in the literature on law, public policy, and political philo...
Adam Barth, Anupam Datta, John C. Mitchell, Helen ...