This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
The 2002 SIGCOMM Workshop on Educational Challenges for Computer Networking [Kur02a] exposed many issues related to teaching computer networking with the need for a laboratory in ...
Michael Erlinger, Mart Molle, Titus Winters, Chris...
The "schooling industry" is faced with an inescapable demand to redefine its endeavors in terms of producing learning, rather than providing instructions. We propose a h...
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Identifying effective tutorial strategies is a key problem for tutorial dialogue systems research. Ongoing work in human-human tutorial dialogue continues to reveal the complex phe...
Kristy Elizabeth Boyer, Eunyoung Ha, Michael D. Wa...