Urmăriți
Giacomo Nannicini
Titlu
Citat de
Citat de
Anul
Qiskit: An open-source framework for quantum computing
G Aleksandrowicz, T Alexander, P Barkoutsos, L Bello, Y Ben-Haim, ...
Accessed on: Mar 16, 2019
648*2019
Demonstration of quantum volume 64 on a superconducting quantum computing system
P Jurcevic, A Javadi-Abhari, LS Bishop, I Lauer, DF Bogorin, M Brink, ...
Quantum Science and Technology 6 (2), 025020, 2021
2742021
Leveraging secondary storage to simulate deep 54-qubit sycamore circuits
E Pednault, JA Gunnels, G Nannicini, L Horesh, R Wisnieff
arXiv preprint arXiv:1910.09534, 2019
1752019
RBFOpt: an open-source library for black-box optimization with costly function evaluations
A Costa, G Nannicini
Mathematical Programming Computation 10, 597-629, 2018
1712018
Pareto-efficient quantum circuit simulation using tensor contraction deferral
E Pednault, JA Gunnels, G Nannicini, L Horesh, T Magerlein, ...
arXiv preprint arXiv:1710.05867, 2017
165*2017
Bidirectional A  ∗  Search for Time-Dependent Fast Paths
G Nannicini, D Delling, L Liberti, D Schultes
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
1502008
An effective algorithm for hyperparameter optimization of neural networks
GI Diaz, A Fokoue-Nkoutche, G Nannicini, H Samulowitz
IBM Journal of Research and Development 61 (4/5), 9: 1-9: 11, 2017
1292017
Improving variational quantum optimization using CVaR
PK Barkoutsos, G Nannicini, A Robert, I Tavernelli, S Woerner
Quantum 4, 256, 2020
1202020
Bidirectional A* search on time‐dependent road networks
G Nannicini, D Delling, D Schultes, L Liberti
Networks, 2010
1202010
Advantages of surrogate models for architectural design optimization
T Wortmann, A Costa, G Nannicini, T Schroepfer
AI EDAM 29 (4), 471-481, 2015
922015
Performance of hybrid quantum-classical variational heuristics for combinatorial optimization
G Nannicini
Physical Review E 99 (1), 013304, 2019
862019
Core routing on dynamic time-dependent road networks
D Delling, G Nannicini
INFORMS Journal on Computing 24 (2), 187-201, 2012
702012
Rounding-based heuristics for nonconvex MINLPs
G Nannicini, P Belotti
Mathematical Programming Computation 4, 1-31, 2012
652012
Bidirectional core-based routing in dynamic time-dependent road networks
D Delling, G Nannicini
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008
652008
Introduction to architectural design optimization
T Wortmann, G Nannicini
City Networks: Collaboration and Planning for Health and Sustainability, 259-278, 2017
502017
A recipe for finding good solutions to MINLPs
L Liberti, N Mladenović, G Nannicini
Mathematical Programming Computation 3, 349-390, 2011
482011
Are genetic algorithms really the best choice for building energy optimization?
T Wortmann, C Waibel, G Nannicini, R Evins, T Schroepfer, J Carmeliet
Proceedings of the Symposium on Simulation for Architecture and Urban Design …, 2017
442017
A good recipe for solving MINLPs
L Liberti, G Nannicini, N Mladenović
Matheuristics: Hybridizing metaheuristics and mathematical programming, 231-244, 2009
432009
Fast paths in large-scale dynamic road networks
G Nannicini, P Baptiste, G Barbier, D Krob, L Liberti
Computational Optimization and Applications 45, 143-158, 2010
422010
Shortest paths on dynamic graphs
G Nannicini, L Liberti
International Transactions in Operational Research 15 (5), 551-563, 2008
412008
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20