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.
A new decomposition optimization algorithm, called path-following gradient-based decomposition, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this algorithm does not require ...
In Switzerland, the largest railway stations are called RailCities by the Swiss Railways. It emphasizes their transformation into places to perform different activities, similar to a small-scale city. Concerns are similar than in urban areas: costs of new ...
Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a non trivial and ...
This paper considers the path following of unmanned helicopters based on dynamic optimization. We assume that the helicopter is equipped with a flight control system which provides an approximation of its closed-loop dynamics. The task at hand is to derive ...
In this thesis, we present new approximation algorithms as well as hardness of approximation results for NP-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such a ...
Advances in statistical physics relating to our understanding of large-scale complex systems have recently been successfully applied in the context of communication networks. Statistical mechanics methods can be used to decompose global system behavior int ...
We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...
Theses slides present a model about activity choice seen as a route/path choice. An activity network is defined. Choice set generation is described. A route/path choice model is proposed. This model includes a measurement equation for WiFi traces, a correc ...
Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...
Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...
