default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonas Nüßlein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Thomy Phan, Felix Sommer, Fabian Ritz, Philipp Altmann, Jonas Nüßlein, Michael Kölle, Lenz Belzner, Claudia Linnhoff-Popien:
Emergent cooperation from mutual acknowledgment exchange in multi-agent reinforcement learning. Auton. Agents Multi Agent Syst. 38(2): 34 (2024)- [c19]Michael Kölle
, Felix Topp, Thomy Phan, Philipp Altmann, Jonas Nüßlein, Claudia Linnhoff-Popien:
Multi-Agent Quantum Reinforcement Learning Using Evolutionary Optimization. ICAART (1) 2024: 71-82 - [c18]Jonas Stein, Daniëlle Schuman, Magdalena Benkard, Thomas Holger, Wanja Sajko, Michael Kölle, Jonas Nüßlein, Leo Sünkel, Olivier Salomon, Claudia Linnhoff-Popien:
Exploring Unsupervised Anomaly Detection with Quantum Boltzmann Machines in Fraud Detection. ICAART (2) 2024: 177-185 - [c17]Robert Müller, Hasan Turalic, Thomy Phan, Michael Kölle, Jonas Nüßlein, Claudia Linnhoff-Popien:
ClusterComm: Discrete Communication in Decentralized MARL Using Internal Representation Clustering. ICAART (1) 2024: 305-312 - [c16]Jonas Stein, Michael Poppel, Philip Adamczyk, Ramona Fabry, Zixin Wu, Michael Kölle, Jonas Nüßlein, Daniëlle Schuman, Philipp Altmann, Thomas Ehmer, Vijay Narasimhan, Claudia Linnhoff-Popien:
Benchmarking Quantum Surrogate Models on Scarce and Noisy Data. ICAART (3) 2024: 352-359 - [c15]Sebastian Zielinski, Magdalena Benkard, Jonas Nüßlein, Claudia Linnhoff-Popien, Sebastian Feld:
SATQUBOLIB: A Python Framework for Creating and Benchmarking (Max-)3SAT QUBOs. I4CS 2024: 48-66 - [c14]Sebastian Zielinski, Jonas Nüßlein, Michael Kölle, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Solving Max-3SAT Using QUBO Approximation. QCE 2024: 681-691 - [i21]Robert Müller, Hasan Turalic, Thomy Phan, Michael Kölle, Jonas Nüßlein, Claudia Linnhoff-Popien:
ClusterComm: Discrete Communication in Decentralized MARL using Internal Representation Clustering. CoRR abs/2401.03504 (2024) - [i20]Gerhard Stenzel, Sebastian Zielinski, Michael Kölle, Philipp Altmann, Jonas Nüßlein, Thomas Gabor:
Qandle: Accelerating State Vector Simulation Using Gate-Matrix Caching and Circuit Splitting. CoRR abs/2404.09213 (2024) - [i19]Tobias Rohe, Daniëlle Schuman, Jonas Nüßlein, Leo Sünkel, Jonas Stein, Claudia Linnhoff-Popien:
The Questionable Influence of Entanglement in Quantum Optimisation Algorithms. CoRR abs/2407.17204 (2024) - [i18]Michael Kölle, Karola Schneider, Sabrina Egger, Felix Topp, Thomy Phan, Philipp Altmann, Jonas Nüßlein, Claudia Linnhoff-Popien:
Architectural Influence on Variational Quantum Circuits in Multi-Agent Reinforcement Learning: Evolutionary Strategies for Optimization. CoRR abs/2407.20739 (2024) - [i17]Jonas Nüßlein, Daniëlle Schuman, David Bucher, Naeimeh Mohseni, Kumar Jang Bahadur Ghosh, Corey O'Meara, Giorgio Cortiana, Claudia Linnhoff-Popien:
Towards Less Greedy Quantum Coalition Structure Generation in Induced Subgraph Games. CoRR abs/2408.04366 (2024) - [i16]Jonas Nüßlein, Maximilian Zorn, Philipp Altmann, Claudia Linnhoff-Popien:
Swarm Behavior Cloning. CoRR abs/2412.07617 (2024) - [i15]Jonas Nüßlein, Maximilian Zorn, Fabian Ritz, Jonas Stein, Gerhard Stenzel, Julian Schönberger, Thomas Gabor, Claudia Linnhoff-Popien:
Optimizing Sensor Redundancy in Sequential Decision-Making Problems. CoRR abs/2412.07686 (2024) - 2023
- [c13]Thomy Phan, Fabian Ritz, Jonas Nüßlein, Michael Kölle, Thomas Gabor, Claudia Linnhoff-Popien:
Attention-Based Recurrency for Multi-Agent Reinforcement Learning under State Uncertainty. AAMAS 2023: 2839-2841 - [c12]Michael Kölle, Steffen Illium, Maximilian Zorn, Jonas Nüßlein, Patrick Suchostawski, Claudia Linnhoff-Popien:
Improving Primate Sounds Classification Using Binary Presorting for Deep Learning. DeLTA 2023: 19-34 - [c11]Jonas Stein, Farbod Chamanian, Maximilian Zorn, Jonas Nüßlein, Sebastian Zielinski, Michael Kölle, Claudia Linnhoff-Popien:
Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA. GECCO Companion 2023: 2254-2262 - [c10]Sebastian Zielinski, Jonas Nüßlein, Jonas Stein, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Influence of Different 3SAT-to-QUBO Transformations on the Solution Quality of Quantum Annealing: A Benchmark Study. GECCO Companion 2023: 2263-2271 - [c9]Steffen Illium, Gretchen Griffin, Michael Kölle, Maximilian Zorn, Jonas Nüßlein, Claudia Linnhoff-Popien:
VoronoiPatches: Evaluating a New Data Augmentation Method. ICAART (3) 2023: 350-357 - [c8]Jonas Nüßlein, Sebastian Zielinski, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization. ICCS (5) 2023: 34-47 - [c7]Jonas Nüßlein, Christoph Roch, Thomas Gabor, Jonas Stein, Claudia Linnhoff-Popien, Sebastian Feld:
Black Box Optimization Using QUBO and the Cross Entropy Method. ICCS (5) 2023: 48-55 - [c6]Thomy Phan, Fabian Ritz, Philipp Altmann, Maximilian Zorn, Jonas Nüßlein, Michael Kölle, Thomas Gabor, Claudia Linnhoff-Popien:
Attention-Based Recurrence for Multi-Agent Reinforcement Learning under Stochastic Partial Observability. ICML 2023: 27840-27853 - [c5]Philipp Altmann, Fabian Ritz, Leonard Feuchtinger, Jonas Nüßlein, Claudia Linnhoff-Popien, Thomy Phan:
CROP: Towards Distributional-Shift Robust Reinforcement Learning Using Compact Reshaped Observation Processing. IJCAI 2023: 3414-3422 - [c4]Maximilian Balthasar Mansky, Jonas Nüßlein, David Bucher, Daniëlle Schuman, Sebastian Zielinski, Claudia Linnhoff-Popien:
Sampling problems on a Quantum Computer. QCE 2023: 485-495 - [c3]Medina Bandic, Luise Prielinger, Jonas Nüßlein, Anabel Ovide, Santiago Rodrigo, Sergi Abadal, Hans van Someren, Gayane Vardoyan, Eduard Alarcón, Carmen G. Almudéver, Sebastian Feld:
Mapping Quantum Circuits to Modular Architectures with QUBO. QCE 2023: 790-801 - [i14]Thomy Phan, Fabian Ritz, Jonas Nüßlein, Michael Kölle, Thomas Gabor, Claudia Linnhoff-Popien:
Attention-Based Recurrency for Multi-Agent Reinforcement Learning under State Uncertainty. CoRR abs/2301.01649 (2023) - [i13]Jonas Nüßlein, Sebastian Zielinski, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization. CoRR abs/2302.03536 (2023) - [i12]Philipp Altmann, Fabian Ritz, Leonard Feuchtinger, Jonas Nüßlein, Claudia Linnhoff-Popien, Thomy Phan:
CROP: Towards Distributional-Shift Robust Reinforcement Learning using Compact Reshaped Observation Processing. CoRR abs/2304.13616 (2023) - [i11]Jonas Stein, Farbod Chamanian, Maximilian Zorn, Jonas Nüßlein, Sebastian Zielinski, Michael Kölle, Claudia Linnhoff-Popien:
Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA. CoRR abs/2305.03390 (2023) - [i10]Medina Bandic, Luise Prielinger, Jonas Nüßlein, Anabel Ovide, Santiago Rodrigo, Sergi Abadal, Hans van Someren, Gayane Vardoyan, Eduard Alarcón, Carmen G. Almudéver, Sebastian Feld:
Mapping quantum circuits to modular architectures with QUBO. CoRR abs/2305.06687 (2023) - [i9]Jonas Stein, Daniëlle Schuman, Magdalena Benkard, Thomas Holger, Wanja Sajko, Michael Kölle, Jonas Nüßlein, Leo Sünkel, Olivier Salomon, Claudia Linnhoff-Popien:
Exploring Unsupervised Anomaly Detection with Quantum Boltzmann Machines in Fraud Detection. CoRR abs/2306.04998 (2023) - [i8]Jonas Stein, Michael Poppel, Philip Adamczyk, Ramona Fabry, Zixin Wu, Michael Kölle, Jonas Nüßlein, Daniëlle Schuman, Philipp Altmann, Thomas Ehmer, Vijay Narasimhan, Claudia Linnhoff-Popien:
Quantum Surrogate Modeling for Chemical and Pharmaceutical Development. CoRR abs/2306.05042 (2023) - [i7]Michael Kölle, Steffen Illium, Maximilian Zorn, Jonas Nüßlein, Patrick Suchostawski, Claudia Linnhoff-Popien:
Improving Primate Sounds Classification using Binary Presorting for Deep Learning. CoRR abs/2306.16054 (2023) - [i6]Michael Kölle, Felix Topp, Thomy Phan, Philipp Altmann, Jonas Nüßlein, Claudia Linnhoff-Popien:
Multi-Agent Quantum Reinforcement Learning using Evolutionary Optimization. CoRR abs/2311.05546 (2023) - 2022
- [c2]Jonas Nüßlein, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Algorithmic QUBO formulations for k-SAT and hamiltonian cycles. GECCO Companion 2022: 2240-2246 - [c1]Jonas Nüßlein, Steffen Illium, Robert Müller, Thomas Gabor, Claudia Linnhoff-Popien:
Case-Based Inverse Reinforcement Learning Using Temporal Coherence. ICCBR 2022: 304-317 - [i5]Jonas Nüßlein, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Algorithmic QUBO Formulations for k-SAT and Hamiltonian Cycles. CoRR abs/2204.13539 (2022) - [i4]Jonas Nüßlein, Steffen Illium, Robert Müller, Thomas Gabor, Claudia Linnhoff-Popien:
Case-Based Inverse Reinforcement Learning Using Temporal Coherence. CoRR abs/2206.05827 (2022) - [i3]Jonas Nüßlein, Christoph Roch, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld:
Black Box Optimization Using QUBO and the Cross Entropy Method. CoRR abs/2206.12510 (2022) - [i2]Steffen Illium, Gretchen Griffin, Michael Kölle, Maximilian Zorn, Jonas Nüßlein, Claudia Linnhoff-Popien:
VoronoiPatches: Evaluating A New Data Augmentation Method. CoRR abs/2212.10054 (2022)
2010 – 2019
- 2019
- [i1]Jonas Nüßlein:
Most Frequent Itemset Optimization. CoRR abs/1904.07693 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
