Perfect Simulation and Stationarity of a Class of Mobility Models
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.
Any finite, separately convex, positively homogeneous function on R2 is convex. This was first established by the first author ["Direct methods in calculus of variations", Springer-Verlag (1989)]. Here we give a new and concise proof of this re ...
In this paper, we introduce the notion of a constrained Minkowski sum: for two (finite) point-sets P, Q subset of R-2 and a set of k inequalities Ax >= b, it is defined as the point-set (P circle plus Q)(Ax >= b) = {x = p + q vertical bar p is an element o ...
The present article evaluates the knowledge that can be attributed to the application of « Best Practices » in the field of urban habitat. It especially aims at identifying the conditions of innovation in such a setting, as well as defining the necessary c ...
We study the problem of distributed detection, where a set of nodes are required to decide between two hypotheses based on their measurements. We seek fully distributed implementations, where all nodes make individual decisions by communicating with their ...
In this paper an Iterative Learning Control (ILC) algorithm is proposed for a certain class of Linear Parameter Varying (LPV) systems whose dynamics change between iterations. Consistency of the algorithm in the presence of stochastic disturbances is shown ...
This paper presents an SVM-based algorithm for the transfer of knowledge across robot platforms aiming to perform the same task. Our method exploits efficiently the transferred knowledge while updating incrementally the internal representation as new infor ...
In this exploratory paper we consider a robust approach to decisional problems subject to uncertain data in which we have an additional knowledge on the strategy (algorithm) used to react to an unforeseen event or recover from a disruption. This is a typic ...
We present an operational framework for the calibration of demand models for dynamic traffic simulations. Our focus is on disaggregate simulators that represent every traveler individually. We calibrate, at a likewise individual level, arbitrary choice dim ...
In this exploratory paper we consider a robust approach to decisional problems subject to uncertain data in which we have an additional knowledge on the strategy (algorithm) used to react to an unforeseen event or recover from a disruption. This is a typic ...
We define ``random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or non convex domains, random walk on torus, billiards, city section, space graph, intercity and other m ...
