Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Mevissen, Martin"'
Quantum computing is a new computational paradigm with the potential to solve certain computationally challenging problems much faster than traditional approaches. Civil engineering encompasses many computationally challenging problems, which leads t
Externí odkaz:
http://arxiv.org/abs/2402.14556
Autor:
Egger, Daniel J., Gambella, Claudio, Marecek, Jakub, McFaddin, Scott, Mevissen, Martin, Raymond, Rudy, Simonetto, Andrea, Woerner, Stefan, Yndurain, Elena
Publikováno v:
IEEE Transactions on Quantum Engineering, vol. 1, pp. 1-24, 2020, Art no. 3101724
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in finance that
Externí odkaz:
http://arxiv.org/abs/2006.14510
The transport literature is dense regarding short-term traffic predictions, up to the scale of 1 hour, yet less dense for long-term traffic predictions. The transport literature is also sparse when it comes to city-scale traffic predictions, mainly b
Externí odkaz:
http://arxiv.org/abs/1911.13042
Publikováno v:
57th Annual Allerton Conference on Communication, Control, and Computing (2019)
We study the projection onto the set of feasible inputs and the set of feasible solutions of a polynomial optimisation problem (POP). Our motivation is increasing the robustness of solvers for POP: Without a priori guarantees of feasibility of a part
Externí odkaz:
http://arxiv.org/abs/1909.07485
Publikováno v:
57th Annual Allerton Conference on Communication, Control, and Computing (2019)
There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP). These often converge to the global optimum of the POP, asymptotically, but prove challenging to solve beyond the
Externí odkaz:
http://arxiv.org/abs/1906.09586
Autor:
Gambella, Claudio, Marecek, Jakub, Mevissen, Martin, Ortega, Jose Maria Fernandez, Djukic, Sara Pezic, Pezic, Mustafa
The unit commitment with transmission constraints in the alternating-current (AC) model is a challenging mixed-integer non-linear optimisation problem. We present an approach based on decomposition of a Mixed-Integer Semidefinite Programming (MISDP)
Externí odkaz:
http://arxiv.org/abs/1806.09408
Autor:
Lassoued, Yassine, Monteil, Julien, Gu, Yingqi, Russo, Giovanni, Shorten, Robert, Mevissen, Martin
We present a simple model and algorithm for predicting driver destinations and routes, based on the input of the latest road links visited as part of an ongoing trip. The algorithm may be used to predict any clusters previously observed in a driver's
Externí odkaz:
http://arxiv.org/abs/1804.03504
Transmission expansion planning requires forecasts of demand for electric power and a model of the underlying physics, i.e., power flows. We present three approaches to deriving exact solutions to the transmission expansion planning problem in the al
Externí odkaz:
http://arxiv.org/abs/1603.04375
Steady states of alternating-current (AC) circuits have been studied in considerable detail. In 1982, Baillieul and Byrnes derived an upper bound on the number of steady states in a loss-less AC circuit [IEEE TCAS, 29(11): 724--737] and conjectured t
Externí odkaz:
http://arxiv.org/abs/1412.8054
Publikováno v:
IEEE Transactions on Power Systems (2016) 31(1): 539-546
Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic convergence in theory.
Comment: A more concise version, which
Comment: A more concise version, which
Externí odkaz:
http://arxiv.org/abs/1404.3626