A quasi-dynamic capacity constrained frequency-based transit assignment model
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 design a sublinear Fourier sampling algorithm for a case of sparse off-grid frequency recovery. These are signals with the form f(t)=∑kj=1ajeiωjt+ν^ , t∈Z ; i.e., exponential polynomials with a noise term. The frequencies {ω j } satisfy ω j ∈ [η,2π − η ...
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 ...
Different typing devices lead to different typing error patterns. In addition, different persons using the same device have different error patterns. Considering this, we propose and evaluate a spelling algorithm specifically designed for a five-key chordi ...
To quantify a player’s commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a “canonical supergame,” which allows each player to adjust his or her move with a certain probability. The commitment meas ...
One of the most important tasks of a sensor network (SN) is to detect occurrences of interesting events in the monitored environment. However, data measured by SN is often affected by errors. We investigate the problem of assessing trustworthiness (trust) ...
The cooperative dynamics of a 1-D collection of Markov jump, interacting stochastic processes is studied via a mean-field (MF) approach. In the time-asymptotic regime, the resulting nonlinear master equation is analytically solved. The nonlinearity compens ...
Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...
Institute of Electrical and Electronics Engineers2015
In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptograp ...
The reaction center protein is the unit in the photosynthetic organisms in which the primary events of the photoelectric energy conversion take place during photosynthesis. When the photochemistry following the excitation of the reaction center by light is ...
A novel approach is proposed to use the Cross Nested Logit (CNL) model in route choice when sampling of paths is considered. It adopts the Metropolis-Hasting algorithm to sample the choice sets for the model. A new expansion factor and an approximation met ...