Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The learning center concept is based on a new vision centered on the need for a convergence of human, information, knowledge, educational resources and a relevant part of information and collaborative technologies. This vision is founded on the new student ...
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the general-purpose programming language Scala with (non-reactive) functional synthesi ...
Gällivare is a remote city in the middle of the northern Swedish wilderness. The city was established as iron ore was found in the ground just over a century ago. Until the 60's the mining industry and the city grew together in what seemed to be a perfect ...
Using a first-principles approach, we assign N 1s core-level shifts at ammonium exposed Si(001)2x1 surfaces to definite bonding configurations of N atoms. Model structures are obtained by fully relaxing the atomic positions of N atoms in different bonding ...
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...
Integrating psychometric indicators in latent class choice models allows to enhance the characterization of the latent classes. In this research, we consider measurement equations that include socio-economic indicators of the decision-makers. We show that ...
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating ...
We present a method for selectively exciting nuclear magnetic resonances (NMRs) from well-defined subsets of crystallites from a powdered sample under magic angle spinning. Magic angle spinning induces a time dependence in the anisotropic interactions, whi ...
Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current too ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...