Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Martin Mevissen"'
Autor:
Daniel J. Egger, Claudio Gambella, Jakub Marecek, Scott McFaddin, Martin Mevissen, Rudy Raymond, Andrea Simonetto, Stefan Woerner, Elena Yndurain
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 1, Pp 1-24 (2020)
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:
https://doaj.org/article/fbbbff4740d44cbc918e5ded1e90670b
Publikováno v:
EURO Journal on Computational Optimization, Vol 5, Iss 1, Pp 1-3 (2017)
Externí odkaz:
https://doaj.org/article/850620cbe6be451786b30554d3d331a7
Autor:
Andrea Simonetto, Claudio Gambella, Scott McFaddin, Jakub Marecek, Daniel J. Egger, Rudy Raymond, Elena Yndurain, Martin Mevissen, Stefan Woerner
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 1, Pp 1-24 (2020)
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ad2c58db1bfb6faf67c5a103fcee765
Publikováno v:
European Journal of Operational Research. 261:450-459
This paper explores polynomial optimization techniques for two formulations of the energy conservation constraint for the valve setting problem in water networks. The sparse hierarchy of semidefinite programing relaxations is used to derive globally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b66aeecabcf52a44c04a2b4fb272b817
https://doi.org/10.1016/j.ejor.2017.03.011
https://doi.org/10.1016/j.ejor.2017.03.011
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91a6a51d1f0a16d8596c4a73ac9b3950
http://arxiv.org/abs/1911.13042
http://arxiv.org/abs/1911.13042
Publikováno v:
Allerton
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f88fdaf656f271aff565f59baa5c677
https://doi.org/10.1109/allerton.2019.8919841
https://doi.org/10.1109/allerton.2019.8919841
Publikováno v:
Allerton
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16da2e5b2cc1afdfa41cef7edd7f0ccb
Publikováno v:
EURO Journal on Computational Optimization, Vol 5, Iss 1, Pp 1-3 (2017)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e079d5fd80901704ca94f8244174bdf7
http://www.sciencedirect.com/science/article/pii/S2192440621000721
http://www.sciencedirect.com/science/article/pii/S2192440621000721
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c212dd3fd0564eab65fb6bc4834b48e
http://arxiv.org/abs/1804.03504
http://arxiv.org/abs/1804.03504
Autor:
Epperlein, Jonathan P., Claudio, Gambella, Griggs, Wynita M., Yassine, Lassoued, Jakub, Marecek, Martin, Mevissen, Julien, Monteil, ORDONEZ-HURTADO, Rodrigo H., Russo, Giovanni, Robert, Shorten, Sergiy, Zhuk
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3666::84abad4ef6f6e2bf251af850038a7ceb
http://hdl.handle.net/11386/4739882
http://hdl.handle.net/11386/4739882