Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
Abstract—We study a problem of broadcasting confidential messages to multiple receivers under an information-theoretic secrecy constraint. Two scenarios are considered: 1) all r...
Ashish Khisti, Aslan Tchamkerten, Gregory W. Worne...
This paper focuses on the use of knowledge possessed by designers. Data collection was based on observations (by the cognitive ergonomics researcher) and simultaneous verbalisation...
The instability of the tree-like multicast overlay caused by nodes' abrupt departures is considered as one of the major problems for peer-to-peer (P2P) multicast systems. In ...
Computer systems are constantly under the threats of being attacked and in many cases these attacks succeed. Today's networked systems are thus built to be intrusion tolerant....