Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Blandin, Sebastien"'
Autor:
Carpentier, Jean, Blandin, Sebastien
Adaptive control is a classical control method for complex cyber-physical systems, including transportation networks. In this work, we analyze the convergence properties of such methods on exemplar graphs, both theoretically and numerically. We first
Externí odkaz:
http://arxiv.org/abs/1906.04388
Increasing urban concentration raises operational challenges that can benefit from integrated monitoring and decision support. Such complex systems need to leverage the full stack of analytical methods, from state estimation using multi-sensor fusion
Externí odkaz:
http://arxiv.org/abs/1906.03040
We present results from several projects aimed at enabling the real-time understanding of crowds and their behaviour in the built environment. We make use of CCTV video cameras that are ubiquitous throughout the developed and developing world and as
Externí odkaz:
http://arxiv.org/abs/1904.10180
The preponderance of connected devices provides unprecedented opportunities for fine-grained monitoring of the public infrastructure. However while classical models expect high quality application-specific data streams, the promise of the Internet of
Externí odkaz:
http://arxiv.org/abs/1903.01045
The Bitcoin transaction graph is a public data structure organized as transactions between addresses, each associated with a logical entity. In this work, we introduce a complete probabilistic model of the Bitcoin Blockchain. We first formulate a set
Externí odkaz:
http://arxiv.org/abs/1812.05451
Bitcoin has created a new exchange paradigm within which financial transactions can be trusted without an intermediary. This premise of a free decentralized transactional network however requires, in its current implementation, unrestricted access to
Externí odkaz:
http://arxiv.org/abs/1810.11956
This article considers the stochastic on-time arrival problem in transit networks where both the travel time and the waiting time for transit services are stochastic. A specific challenge of this problem is the combinatorial solution space due to the
Externí odkaz:
http://arxiv.org/abs/1808.04360
We consider the problem of finding an optimal history-dependent routing strategy on a directed graph weighted by stochastic arc costs when the objective is to minimize the risk of spending more than a prescribed budget. To help mitigate the impact of
Externí odkaz:
http://arxiv.org/abs/1408.3374
Publikováno v:
In Transportation Research Part B January 2019 119:122-138
Publikováno v:
Operations Research, 2018 Jan 01. 66(1), 210-229.
Externí odkaz:
https://www.jstor.org/stable/48748241