We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
The impact of affect on learning has been the subject of increasing attention. Because of the differential effects of students’ affective states on learning outcomes, there is a ...
Jennifer L. Robison, Scott W. McQuiggan, James C. ...
The first trial of using the symmetry analysis method in modeling of behavior of complex social system is presented in this work. The evacuation of large building scenarios are d...
Abstract— We propose formal models for analyzing robustness of multi-hop control networks, where data from sensors to controllers and from controllers to actuators is sent throug...
Gera Weiss, Alessandro D'Innocenzo, Rajeev Alur, K...