Concept

Microsoft Windows

Related publications (72)

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.

Dynamic Transit Priority Lanes in Urban Networks

Together with signal priority, dedication of space to public transport has been the most widely used policy to improve bus operations. Permanent dedicated bus lanes however can lead to an under-utilization of the available space. Dierent strategies such as ...

2020

The electric autonomous dial-a-ride problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provides shared-ride services to users specifying their origin, destination, and preferred arrival time. Typically, the problem consists of finding minimum cost routes, satisfying operational constraint ...

Elsevier2019

Shrinking Bouma's window: Visual crowding in dense displays

Michael Herzog, Gregory Francis, Adrien Christophe Doerig, Alban Bornet

In crowding, perception of a target deteriorates in the presence of nearby flankers. In the traditional feedforward framework of vision, only elements within Bouma’s window interfere with the target and adding more elements always leads to stronger crowdin ...

SAGE PUBLICATIONS LTD2019

Discrete windows of feature integration

Michael Herzog, Adrien Christophe Doerig

A car drives through the night. It is hard to estimate its color from single photoreceptor activity because photoreceptor activation is short and noisy. An efficient way to estimate the color is to average photoreceptor activities along the car’s motion tr ...

SAGE PUBLICATIONS LTD2019

A Two Phase Heuristic Approach For The Dynamic Electric Autonomous Dial-a-Ride Problem

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provide shared-ride services to users specifying their origin, destination, and preferred arrival time. In the dynamic version of the DARP, some trips are booked in advance while others come in real-tim ...

2018

The online electric autonomous dial-a-ride problem

Anouk Larisse Allenspach

The DARP (Dial-a-Ride Problem) is concerned with providing service to a number of requests, specifying their location of origin and destination, as well as time windows indicating their desired service time for at least one of the locations. In the dynamic ...

2018

SAT-Based Area Recovery in Structural Technology Mapping

Bruno Schmitt Antunes

This paper proposes a fast SAT-based algorithm for recovering area applicable to an already technology mapped circuit. The algorithm considers a sequence of relatively small overlapping regions, called windows, in a mapped network and tries to improve the ...

ASSOC COMPUTING MACHINERY2018

Validation of LIRIC aerosol concentration retrievals using airborne measurements during a biomass burning episode over Athens

Athanasios Nenes

In this paper we validate the Lidar-Radiometer Inversion Code (LIRIC) retrievals of the aerosol concentration in the fine mode, using the airborne aerosol chemical composition dataset obtained over the Greater Athens Area (GAA) in Greece, during the ACEMED ...

2017

Minimal Window Duration for Accurate HRV Recording in Athletes

Jean-Marc Vesin, Grégoire Millet, Sasan Yazdani

Heart rate variability (HRV) is non-invasive and commonly used for monitoring responses to training loads, fitness, or overreaching in athletes. Yet, the recording duration for aseries of RR-intervals varies from 1 to 15 min in the literature. The aim of t ...

Frontiers Research Foundation2017

Neural Correlates of Sequential Decision Making

Michael Herzog, He Xu

In chess, a series of moves is made until a delayed sparse feedback (win, loss) is issued, which makes it impossible to evaluate the value of a single move. There are powerful reinforcement learning (RL) algorithms, which can cope with these sequential dec ...

2017