Concept

Logo (programming language)

Related publications (7)

Harnessing Rule-Based Chatbots to Support Teaching Python Programming Best Practices

Denis Gillet, Juan Carlos Farah, Sandy Ingram, Adrian Christian Holzer

In recent years, the use of chatbots in education has been driven by advances in natural language processing and the increasing availability of digital education platforms. Although the added value of educational chatbots appears promising, researchers hav ...

2023

3D Printed Acoustically Programmable Soft Microactuators

Mahmut Selman Sakar, Murat Kaynak, Amit Yedidia Dolev

The concept of creating all-mechanical soft microrobotic systems has great potential to address outstanding challenges in biomedical applications, and introduce more sustainable and multifunctional products. To this end, magnetic fields and light have been ...

2022

A Tangible Programming Language for the Educational Robot Thymio

Francesco Mondada, Alberto Piatti, Christian Giang, Andrea Mussati

In the past, the use of tangible programming languages has shown several advantages compared to screen-based graphical programming languages. Especially when presented to novices, such interfaces may represent a more intuitive and straightforward alternati ...

2019

Learning from Demonstration (Programming by Demonstration)

Sylvain Calinon

Learning from Demonstration (LfD), also called Programming by Demonstration (PbD), refers to the process used to transfer new skills to a machine by relying on demonstrations from a user. It is inspired by the imitation capability developed by humans and a ...

Springer2019

Computationally Efficient Multiple-Independent-Gate Device Model

Giovanni De Micheli, Mariagrazia Graziano, Pierre-Emmanuel Julien Marc Gaillardon, Gianluca Piccinini

Nanowire Field Effect Transistors (FETs) with multiple independent gates around a silicon channel feature ultimate gate control and are regarded as promising candidates for next generation transistors. Being inherently more complex than conventional gate-a ...

Institute of Electrical and Electronics Engineers2016

Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing

Nisheeth Vishnoi

We prove that for an arbitrarily small constant < 0, the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor 2log1-en, under the assumption that NP ⊈ SIZE(2logO(1/e)n). © 2014 Soc ...

Society for Industrial and Applied Mathematics2014

Loop-Level Parallelism in Numeric and Symbolic Programs

James Richard Larus

A new technique for estimating and understanding the speed improvement that can result from executing a program on a parallel computer is described. The technique requires no additional programming and minimal effort by a program's author. The analysis beg ...

IEEE1993

Graph Chatbot

Chat with Graph Search

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.