Mitigating the impact of selfish routing: An optimal-ratio control scheme (ORCS) inspired by autonomous driving
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.
We present an extension of a classical data management subproblem, the page migration. The problem is investigated in dynamic networks, where costs of communication between different nodes may change with time. We construct asymptotically optimal online al ...
This paper seeks to explore the relationship between mode and destination choice in an integrated nested choice model. A fundamental argument can be made that in certain circumstances, the ordering of choices should be reversed from the usual sequence of d ...
Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a ...
This thesis focuses on the route choice behavior of car drivers (uni-modal networks). More precisely, we are interested in identifying which route a given traveler would take to go from one location to another. For the analysis of this problem we use discr ...
Continuous queries over data streams typically produce large volumes of result streams. To scale up the system, one should carefully study the problem of delivering the result streams to the end users, which, unfortunately, is often over-looked in existing ...
We present two variants of Moler and Stewart's algorithm for reducing a matrix pair to Hessenberg-triangular (HT) form with increased data locality in the access to the matrices. In one of these variants, a careful reorganization and accumulation of Givens ...
In this thesis, we focus on standard classes of problems in numerical optimization: unconstrained nonlinear optimization as well as systems of nonlinear equations. More precisely, we consider two types of unconstrained nonlinear optimization problems. On t ...
We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...
The Intelligent Grid Scheduling Service (ISS) aims at finding an optimally suited computational resource for a given application component. An objective cost model function is used to decide it. It includes information on a parametrization of the component ...
Transportation literature suggests that men and women have different characteristics with respect to commuting patterns, as well as with respect to their propensity to switch between travel options. In North America, women are expected to have an increasin ...
