Quantum versus simulated annealing in wireless interference network optimization
暂无分享,去创建一个
[1] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[2] Fabián A. Chudak,et al. Experimental determination of Ramsey numbers. , 2012, Physical Review Letters.
[3] Aidan Roy,et al. A practical heuristic for finding graph minors , 2014, ArXiv.
[4] Daniel A. Lidar,et al. Evidence for quantum annealing with more than one hundred qubits , 2013, Nature Physics.
[5] Elena Marchiori,et al. Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem , 2002, EvoWorkshops.
[6] Andrew D. King,et al. Algorithm engineering for a quantum annealing platform , 2014, ArXiv.
[7] Mhand Hifi,et al. A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems , 1997 .
[8] Michael Dinitz,et al. Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory , 2009, IEEE INFOCOM 2009.
[9] T. Grossman. Applying The INN Model to the MaxClique Problem , 1993 .
[10] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[11] Randeep Bhatia,et al. Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2005, IEEE Journal on Selected Areas in Communications.
[12] Mark W. Johnson,et al. Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor , 2014, IEEE Transactions on Applied Superconductivity.
[13] Aravind Srinivasan,et al. Capacity of wireless networks under SINR interference constraints , 2011, Wirel. Networks.
[14] Chi Wang,et al. Interference constrained network control based on curvature , 2016, 2016 American Control Conference (ACC).
[15] Rupak Biswas,et al. Estimation of effective temperatures in a quantum annealer and its impact in sampling applications: A case study towards deep learning applications , 2015 .
[16] Matthew French,et al. Experimental quantum annealing: case study involving the graph isomorphism problem , 2015, Scientific Reports.
[17] Leandros Tassiulas,et al. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .
[18] R. Biswas,et al. A quantum annealing approach for fault detection and diagnosis of graph-based systems , 2014, The European Physical Journal Special Topics.
[19] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[20] Ness B. Shroff,et al. On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..
[21] Paolo Santi,et al. Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference , 2010, IEEE/ACM Transactions on Networking.
[22] Matthias Troyer,et al. Optimised simulated annealing for Ising spin glasses , 2014, Comput. Phys. Commun..
[23] Laura A. Sanchis,et al. Approximately solving Maximum Clique using neural network and related heuristics , 1993, Cliques, Coloring, and Satisfiability.
[24] Chatschik Bisdikian,et al. Bluetooth Revealed: The Insider's Guide to an Open Specification for Global Wireless Communications , 2001 .
[25] Peng-Jun Wan,et al. Multiflows in multihop wireless networks , 2009, MobiHoc '09.
[26] Daniel A. Lidar,et al. Defining and detecting quantum speedup , 2014, Science.
[27] Lili Qiu,et al. Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.
[28] Chi Wang,et al. Ollivier-Ricci curvature and fast approximation to tree-width in embeddability of QUBO problems , 2014, 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP).
[29] Arun Jagota,et al. Approximating maximum clique with a Hopfield network , 1995, IEEE Trans. Neural Networks.
[30] Daniel A. Lidar,et al. Quantum adiabatic machine learning , 2011, Quantum Inf. Process..
[31] Ray,et al. Sherrington-Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations. , 1989, Physical review. B, Condensed matter.
[32] Bryan O'Gorman,et al. A case study in programming a quantum annealer for hard operational planning problems , 2014, Quantum Information Processing.
[33] Daniel A. Lidar,et al. Probing for quantum speedup in spin-glass problems with planted solutions , 2015, 1502.01663.
[34] R. Srikant,et al. Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.
[35] Roger Wattenhofer,et al. Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.
[36] Andrew Lucas,et al. Ising formulations of many NP problems , 2013, Front. Physics.
[37] Marcus Peinado,et al. Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs , 1993, Cliques, Coloring, and Satisfiability.
[38] Christoph Koch,et al. Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum Computer , 2015, Proc. VLDB Endow..
[39] Vicky Choi,et al. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..
[40] Murali S. Kodialam,et al. Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.
[41] G. Rose,et al. Finding low-energy conformations of lattice protein models by quantum annealing , 2012, Scientific Reports.
[42] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[43] E. Farhi,et al. A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.
[44] Daniel A. Lidar,et al. Adiabatic quantum optimization with the wrong Hamiltonian , 2013, 1310.0529.
[45] Mauricio G. C. Resende,et al. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..
[46] Vicky Choi,et al. Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design , 2010, Quantum Inf. Process..
[47] Carlo Mannino,et al. An Augmentation Algorithm for the Maximum Weighted Stable Set Problem , 1999, Comput. Optim. Appl..
[48] Alain Hertz,et al. STABULUS: A technique for finding stable sets in large graphs with tabu search , 1989, Computing.
[49] ChoiVicky. Minor-embedding in adiabatic quantum computation , 2008 .
[50] Thang Nguyen Bui,et al. A Hybrid Genetic Algorithm for the Maximum Clique Problem , 1995, ICGA.
[51] Bhaskar Krishnamachari,et al. Dirichlet's principle on multiclass multihop wireless networks: minimum cost routing subject to stability , 2014, MSWiM '14.
[52] Michel Gendreau,et al. Tabu search algorithms for the maximum clique problem , 1993, Cliques, Coloring, and Satisfiability.
[53] H. Nishimori,et al. Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.
[54] Madhav V. Marathe,et al. The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks , 2004, IEEE Journal on Selected Areas in Communications.
[55] Alán Aspuru-Guzik,et al. Bayesian network structure learning using quantum annealing , 2014, The European Physical Journal Special Topics.