Concept

Problème de plus court chemin

Publications associées (252)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The School Bus Problem on Trees

Laura Sanità, Adrian Aloysius Bock

The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to ...

Springer US2013

Optimization-based solutions to constrained trajectory-tracking and path-following problems

Timm Faulwasser

The prototypical problem in control theory is the stabilization of a set point. When, instead of a set point, a time-varying reference needs to be stabilized, then the problem is called trajectory tracking. Typical examples of trajectory-tracking problems ...

Shaker Verlag2013

A Network Coding Approach to Loss Tomography

Christina Fragouli

Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links and multicast and/or unicast end- ...

Institute of Electrical and Electronics Engineers2013

HydroZIP: How Hydrological Knowledge can Be Used to Improve Compression of Hydrological Data

Marc Parlange, Steven Vincent Weijs, Nicolaas Cornelis van de Giesen

From algorithmic information theory, which connects the information content of a data set to the shortest computer program that can produce it, it is known that there are strong analogies between compression, knowledge, inference and prediction. The more w ...

MDPI AG2013

On-shoe wearable sensors for gait and turning assessment of patients with Parkinson’s disease

Kamiar Aminian, Benoît Mariani

Assessment of locomotion through simple tests such as timed up and go (TUG) or walking trials can provide valuable information for the evaluation of treatment and the early diagnosis of people with Parkinson's disease (PD). Common methods used in clinics a ...

Institute of Electrical and Electronics Engineers2013

Advantageous State Merging During Symbolic Analysis

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Stefan Bucur

A determination is made regarding whether to merge two symbolic analysis states. A first state corresponds to a first path through a program to a program location and a second state corresponds to a second path through the program to the program location. ...

2013

On the efficiency of routing in sensor networks

Florian Huc

In sensor networks, a key efficiency measure for routing protocols is the stretch of the computed paths, where the stretch is the ratio of the path length and the Euclidean distance covered. In the literature, many protocols have been evaluated via extensi ...

2012

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

Ieee2012

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

IEEE2012

Are motorways rational from slime mould's point of view ?

Emanuele Strano

We analyse the results of our experimental laboratory approximation of motorways networks with slime mould Physarum polycephalum. Motorway networks of fourteen geographical areas are considered: Australia, Africa, Belgium, Brazil, Canada, China, Germany, I ...

2012