The 3rd Alumni Meeting of the Laboratório de Jogos of Instituto Superior Técnico (III Encontro de Alumni do Laboratório de Jogos do IST), was held on October 26th at 5:15 pm, at the IST Taguspark Campus. In this event the … Continued
Luís Henriques, Ricardo Rei and Luís Nunes, Master Students at INESC-ID, won the 12th edition of the EDP University Challenge 2018 contest that took place October 9th at EDP’s headquarters in Lisbon. Inspired by the theme of this edition – … Continued
Yair Amir , Johns Hopkins University – Abstract: Emerging applications such as remote manipulation and remote robotic surgery require communication that is both timely and reliable, but the Internet natively supports only communication that is either completely reliable with no … Continued
Gert Jan Hofstede, Wageningen Universiteit – Abstract: Gert Jan will discuss ‘artificial sociality’, the subject for which he was recently appointed professor. It is about foundational conceptual models of human sociality based on social science, for use in agent-based … Continued
Max Grossman, RICE UNIVERSITY – Abstract: Many problems can benefit from being phrased as a graph processing or graph analytics problem: infectious disease modeling, insider threat detection, fraud prevention, social network analysis, and more. These problems all share a common … Continued
Christoph Kirsch, University of Salzburg – Abstract: Selfie is a self-contained 64-bit, 10-KLOC implementation of (1) a self-compiling compiler written in a tiny subset of C called C* targeting a tiny subset of 64-bit RISC-V called RISC-U, (2) a self-executing … Continued
David Brumley , Carnegie Mellon University – Abstract: My vision is to automatically check and defend the world’s software from exploitable bugs. In order to achieve this vision, I am building technology, called Mayhem, that shifts the attack/defend game away … Continued
Tobias Dietz, Technische Universität Kaiserslautern – Abstract: Maximum-likelihood decoding is an important and powerful tool in communications to obtain the optimal performance of a channel code. Unfortunately, simulating the maximum-likelihood performance of a code is a hard problem whose complexity … Continued
Luca Schafer, Technische Universität Kaiserslautern – Abstract: We investigate the single-source-single-destination “shortest” paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels, respectively. Further, … Continued
Erica Tena-Sánchez F. E. Potestad-Ordóñez , University of Seville – Abstract: Any electronic devices considered ‘secure’, and in fact any electronic device handling relevant information, make use of cryptographic services to ensure confidentiality, authentication and integrity of the processed data. … Continued
