default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Lässig
Person information
- affiliation: Hochschule Zittau/Görlitz, Görlitz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j13]Tianyu Liang
, Zhize Wu, Jörg Lässig, Daan van den Berg, Sarah L. Thomson, Thomas Weise:
Addressing the traveling salesperson problem with frequency fitness assignment and hybrid algorithms. Soft Comput. 28(17-18): 9495-9508 (2024)- [c58]Daniel Müssig, Markus Wappler, Steve Lenk, Jörg Lässig:
Connecting the Hamiltonian structure to the QAOA performance and energy landscape. INFORMATIK 2024: 595-604 - [i10]Matthias Klusch, Jörg Lässig, Daniel Müssig, Antonio Macaluso, Frank K. Wilhelm:
Quantum Artificial Intelligence: A Brief Survey. CoRR abs/2408.10726 (2024) - 2023
- [j12]Thomas Weise, Zhize Wu, Xinlu Li, Yan Chen, Jörg Lässig:
Frequency Fitness Assignment: Optimization Without Bias for Good Solutions Can Be Efficient. IEEE Trans. Evol. Comput. 27(4): 980-992 (2023) - [c57]Marika Federer, Steve Lenk, Daniel Müssig, Markus Wappler, Jörg Lässig:
Constrained Grover Adaptive Search for Optimization of the Bidirectional EV Charging Problem. GI-Jahrestagung 2023: 1121-1127 - [c56]Fanny Weidner, Laurenz Bischoff, Johannes Bätz, Robin Schöppach, Peter Meineke, Kevin Kambach, Jannick Mitsch, Andreas Motuzov, Martin Mieth, Andreas Schulz, Melissa Weidlich-Rau, Christian Roschke, Matthias Vodel, Alexander Thomas Kühn, Tobias Czauderna, Daniel Müssig, Manuel Heinzig, Jörg Lässig, Marc Ritter:
A VR Office Applying Modern Search and Filter Concepts for Knowledge Workers. HCI (17) 2023: 101-113 - [c55]Falko Gawantka, Franz Just, Markus Ullrich, Marina Savelyeva, Jörg Lässig:
Evaluation of XAI Methods in a FinTech Context. IWAIPR 2023: 143-154 - 2022
- [c54]Falko Gawantka, Andreas Schulz, Jörg Lässig, Franz Just:
SkillDB - An Evaluation on the stability of XAI algorithms for a HR decision support system and the legal context. ICCI*CC 2022: 183-190 - [c53]Marika Federer, Daniel Müssig, Steve Lenk, Jörg Lässig:
Real-world application benchmark for QAOA algorithm for an electromobility use case. GI-Jahrestagung 2022: 1145-1151 - [c52]Volker Reers, Jörg Lässig:
A new Pattern for Quantum Evolutionary Algorithms. GI-Jahrestagung 2022: 1153-1162 - [c51]Maximilian Selch, Daniel Müssig, Albrecht Hänel, Jörg Lässig, Steffen Ihlenfeldt:
Influence Estimation In Multi-Step Process Chains Using Quantum Bayesian Networks. GI-Jahrestagung 2022: 1163-1173 - [c50]Daniel Müssig, Jörg Lässig:
Quantum Computer and Quantum Algorithm Benchmarking. GI-Jahrestagung 2022: 1175-1178 - [c49]Tianyu Liang, Zhize Wu, Jörg Lässig, Daan van den Berg, Thomas Weise:
Solving the Traveling Salesperson Problem using Frequency Fitness Assignment. SSCI 2022: 360-367 - 2021
- [i9]Thomas Weise, Zhize Wu, Xinlu Li, Yan Chen, Jörg Lässig:
Frequency Fitness Assignment: Optimization without a Bias for Good Solutions can be Efficient. CoRR abs/2112.00229 (2021) - 2020
- [j11]Thomas Weise, Markus Wagner, Bin Li, Xingyi Zhang, Jörg Lässig:
Special Issue on Benchmarking of Computational Intelligence Algorithms in the Applied Soft Computing Journal. Appl. Soft Comput. 93: 106502 (2020) - [j10]Jörg Lässig:
Angewandtes Quantencomputing. Inform. Spektrum 43(5): 347-351 (2020)
2010 – 2019
- 2018
- [c48]Markus Ullrich, Thomas Weise, Abhishek Awasthi, Jörg Lässig:
A generic problem instance generator for discrete optimization problems. GECCO (Companion) 2018: 1761-1768 - [c47]Robert Stricker, Daniel Müssig, Jörg Lässig:
Microservices for Redevelopment of Enterprise Information Systems and Business Processes Optimization. ICEIS (2) 2018: 719-726 - [c46]Markus Ullrich, Jörg Lässig, Jingtao Sun, Martin Gaedke, Kento Aida:
A Benchmark Model for the Creation of Compute Instance Performance Footprints. IDCS 2018: 221-234 - [c45]Sebastian Pape, Daniel Tasche, Iulia Bastys, Akos Grosz, Jörg Lässig, Kai Rannenberg:
Towards an Architecture for Pseudonymous E-Commerce - Applying Privacy by Design to Online Shopping. Sicherheit 2018: 17-28 - 2017
- [c44]Daniel Müssig, Robert Stricker, Jörg Lässig, Jens Heider:
Highly Scalable Microservice-based Enterprise Architecture for Smart Ecosystems in Hybrid Cloud Environments. ICEIS (3) 2017: 454-459 - [c43]Markus Ullrich, Jörg Lässig, Kento Aida, Jingtao Sun, Tomoya Tanjo, Martin Gaedke:
An application meta-model to support the execution and benchmarking of scientific applications in multi-cloud environments. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2017: 1-6 - 2016
- [j9]Thomas Weise, Yuezhong Wu, Raymond Chiong, Ke Tang, Jörg Lässig:
Global versus local search: the impact of population sizes on evolutionary algorithm performance. J. Glob. Optim. 66(3): 511-534 (2016) - [c42]Abhishek Awasthi, Jörg Lässig, Thomas Weise, Oliver Kramer:
Tackling Common Due Window Problem with a Two-Layered Approach. COCOA 2016: 772-781 - [c41]Waheed Aslam Ghumman, Alexander Schill, Jörg Lässig:
The Flip-Flop SLA Negotiation Strategy Using Concession Extrapolation and 3D Utility Function. CIC 2016: 159-168 - [c40]Jens Heider, Jörg Lässig:
Convergent Infrastructures for Municipalities as Connecting Platform for Climate Applications. EnviroInfo (1) 2016: 311-320 - [c39]Markus Ullrich, Jörg Lässig, Martin Gaedke:
Towards Efficient Resource Management in Cloud Computing: A Survey. FiCloud 2016: 170-177 - [c38]Adam Bartusiak, Jörg Lässig:
Semantic Processing for the Conversion of Unstructured Documents into Structured Information in the Enterprise Context. SEMANTiCS 2016: 125-128 - [c37]Abhishek Awasthi, Jörg Lässig, Jens Leuschner, Thomas Weise:
GPGPU-Based Parallel Algorithms for Scheduling Against Due Date. IPDPS Workshops 2016: 766-775 - [c36]Justin Heinermann, Jörg Lässig, Oliver Kramer:
Evolutionary Multi-objective Ensembles for Wind Power Prediction. DARE@PKDD/ECML 2016: 92-101 - [c35]Nico Schlitter, Markus Ullrich, Jörg Lässig:
Scalability and performance of the Privacy-Aware Classification method GenPAC. PST 2016: 376-383 - [c34]Andreas Schulz, Jörg Lässig, Martin Gaedke:
Practical Web Data Extraction: Are We There Yet? - A Short Survey. WI 2016: 562-567 - [p3]Jörg Lässig:
Sustainable Development and Computing - An Introduction. Computational Sustainability 2016: 1-12 - [e1]Jörg Lässig, Kristian Kersting, Katharina Morik:
Computational Sustainability. Studies in Computational Intelligence 645, Springer 2016, ISBN 978-3-319-31856-1 [contents] - 2015
- [c33]Dan Xu, Thomas Weise, Yuezhong Wu, Jörg Lässig, Raymond Chiong:
An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem. BIC-TA 2015: 523-537 - [c32]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence. ICEIS (1) 2015: 526-534 - 2014
- [j8]Christoph Goebel, Hans-Arno Jacobsen, Victor del Razo, Christoph Doblander, José Rivera, Jens P. Ilg, Christoph M. Flath, Hartmut Schmeck, Christof Weinhardt, Daniel Pathmaperuma, Hans-Jürgen Appelrath, Michael Sonnenschein, Sebastian Lehnhoff, Oliver Kramer, Thorsten Staake, Elgar Fleisch, Dirk Neumann, Jens Strüker, Koray Erek, Rüdiger Zarnekow, Holger Ziekow, Jörg Lässig:
Energy Informatics - Current and Future Research Directions. Bus. Inf. Syst. Eng. 6(1): 25-31 (2014) - [j7]Thomas Weise, Raymond Chiong, Jörg Lässig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao:
Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. IEEE Comput. Intell. Mag. 9(3): 40-52 (2014) - [j6]Jörg Lässig, Dirk Sudholt:
General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms. Evol. Comput. 22(3): 405-437 (2014) - [j5]Nico Schlitter, Tanja Falkowski, Jörg Lässig:
DenGraph-HO: a density-based hierarchical graph clustering algorithm. Expert Syst. J. Knowl. Eng. 31(5): 469-479 (2014) - [j4]Jörg Lässig, Dirk Sudholt:
Analysis of speedups in parallel evolutionary algorithms and (1+λ) EAs for combinatorial optimization. Theor. Comput. Sci. 551: 66-83 (2014) - [j3]Christoph Goebel, Hans-Arno Jacobsen, Victor del Razo, Christoph Doblander, José Rivera, Jens P. Ilg, Christoph M. Flath, Hartmut Schmeck, Christof Weinhardt, Daniel Pathmaperuma, Hans-Jürgen Appelrath, Michael Sonnenschein, Sebastian Lehnhoff, Oliver Kramer, Thorsten Staake, Elgar Fleisch, Dirk Neumann, Jens Strüker, Koray Erek, Rüdiger Zarnekow, Holger Ziekow, Jörg Lässig:
Energieinformatik - Aktuelle und zukünftige Forschungsschwerpunkte. Wirtschaftsinf. 56(1): 31-39 (2014) - [c31]Abhishek Awasthi, Jörg Lässig, Oliver Kramer, Thomas Weise:
Common Due-Window problem: Polynomial algorithms for a given processing sequence. CIPLS 2014: 32-39 - [c30]Yan Jiang, Thomas Weise, Jörg Lässig, Raymond Chiong, Rukshan Athauda:
Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP. CIPLS 2014: 148-155 - [c29]Jörg Lässig, Abhishek Awasthi, Oliver Kramer:
Common Due-Date Problem: Linear Algorithm for a Given Job Sequence. CSE 2014: 97-104 - [c28]Markus Will, Jörg Lässig, Daniel Tasche, Jens Heider:
Regional Carbon Footprinting for Municipalities and Cities. EnviroInfo 2014: 653-660 - [i8]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines. CoRR abs/1405.1234 (2014) - 2013
- [j2]Jörg Lässig, Dirk Sudholt:
Design and analysis of migration in parallel evolutionary algorithms. Soft Comput. 17(7): 1121-1144 (2013) - [c27]Waheed Aslam Ghumman, Jörg Lässig:
Verification Requirements for Secure and Reliable Cloud Computing. CGC 2013: 143-150 - [c26]Abhishek Awasthi, Oliver Kramer, Jörg Lässig:
Aircraft Landing Problem: An Efficient Algorithm for a Given Landing Sequence. CSE 2013: 20-27 - [c25]Jörg Lässig, Markus Ullrich:
Enterprise Application Integration - The Cloud Perspective. ICWE 2013: 522-525 - [c24]Markus Ullrich, Klaus ten Hagen, Jörg Lässig:
A data mining approach to reduce the number of maintenance visits in the medical domain. IDAACS 2013: 255-258 - [c23]Jens Heider, Daniel Tasche, Jörg Lässig, Markus Will:
A greenhouse gas accounting tool for regional and municipal climate change management. SustainIT 2013: 1-3 - [c22]Max Wielsch, Raik Bieniek, Bernd Grams, Jörg Lässig:
Dynamic integration of ALM tools for agile software development. SII 2013: 567-573 - [c21]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence. SYNASC 2013: 258-264 - [i7]Abhishek Awasthi, Jörg Lässig, Oliver Kramer:
Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence. CoRR abs/1311.2879 (2013) - [i6]Abhishek Awasthi, Oliver Kramer, Jörg Lässig:
Aircraft Landing Problem: Efficient Algorithm for a Given Landing Sequence. CoRR abs/1311.2880 (2013) - [i5]Max Wielsch, Raik Bieniek, Bernd Grams, Jörg Lässig:
Dynamic Integration of ALM Tools for Agile Software Development. CoRR abs/1311.5587 (2013) - 2012
- [c20]Markus Ullrich, Klaus ten Hagen, Jörg Lässig:
Public Cloud Extension for Desktop Applications - Case Study of a Data Mining Solution. NCCA 2012: 53-64 - [c19]Nico Schlitter, Jörg Lässig:
Distributed Privacy Preserving Classification Based on Local Cluster Identifiers. TrustCom 2012: 1265-1272 - [p2]Jörg Lässig, Christian A. Hochmuth, Stefanie Thiem:
Simulation-Based Evolutionary Optimization of Complex Multi-Location Inventory Models. Variants of Evolutionary Algorithms for Real-World Applications 2012: 95-141 - [i4]Jörg Lässig, Dirk Sudholt:
General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms. CoRR abs/1206.3522 (2012) - 2011
- [c18]Jörg Lässig, Dirk Sudholt:
Adaptive population models for offspring populations and parallel evolutionary algorithms. FOGA 2011: 181-192 - [c17]Jörg Lässig, Dirk Sudholt:
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract). ISAAC 2011: 405-414 - [c16]Jörg Lässig, Benjamin Satzger, Oliver Kramer:
Self-Stabilization in Hierarchically Structured Energy Markets. ITNG 2011: 803-809 - [c15]Jörg Lässig, Benjamin Satzger, Oliver Kramer:
Hierarchically Structured Energy Markets as Novel Smart Grid Control Approach. KI 2011: 179-190 - [c14]Nico Schlitter, Tanja Falkowski, Jörg Lässig:
DenGraph-HO: Density-based Hierarchical Community Detection for Explorative Visual Network Analysis. SGAI Conf. 2011: 283-296 - [p1]Christian A. Hochmuth, Jörg Lässig, Stefanie Thiem:
Optimizing Complex Multi-location Inventory Models Using Particle Swarm Optimization. Computational Optimization, Methods and Algorithms 2011: 101-124 - [i3]Jörg Lässig, Dirk Sudholt:
Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms. CoRR abs/1102.0588 (2011) - [i2]Jörg Lässig, Dirk Sudholt:
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization. CoRR abs/1109.1766 (2011) - 2010
- [j1]Jörg Lässig:
Analysis and Efficiency of Randomized Optimization Heuristics (Analyse und Effizienz randomisierter Optimierungsheuristiken). it Inf. Technol. 52(6): 345-349 (2010) - [c13]Jörg Lässig, Dirk Sudholt:
The benefit of migration in parallel evolutionary algorithms. GECCO 2010: 1105-1112 - [c12]Oliver Kramer, Benjamin Satzger, Jörg Lässig:
Managing Energy in a Virtual Power Plant Using Learning Classifier Systems. GEM 2010: 111-117 - [c11]Oliver Kramer, Benjamin Satzger, Jörg Lässig:
Power Prediction in Smart Grids with Evolutionary Local Kernel Regression. HAIS (1) 2010: 262-269 - [c10]Benjamin Satzger, Oliver Kramer, Jörg Lässig:
Adaptive Heuristic Estimates for Automated Planning Using Regression. IC-AI 2010: 576-581 - [c9]Jörg Lässig, Ullrich Trommler:
New Approaches to Enterprise Cooperation Generation and Management. ICEIS (2) 2010: 350-359 - [c8]Jörg Lässig, Dirk Sudholt:
Experimental Supplements to the Theoretical Analysis of Migration in the Island Model. PPSN (1) 2010: 224-233 - [c7]Jörg Lässig, Dirk Sudholt:
General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. PPSN (1) 2010: 234-243
2000 – 2009
- 2009
- [c6]Jörg Lässig, Steffen Heinrich, Holger Dürr:
Intelligent Support System for Enterprise Cooperation Management. IICAI 2009: 1626-1645 - [c5]Jörg Lässig, Karl-Heinz Hoffmann:
On the Structure of a Best Possible Crossover Selection Strategy in Genetic Algorithms. SGAI Conf. 2009: 263-276 - 2008
- [c4]Stefanie Thiem, Jörg Lässig, Peter Köchel:
Merging Groups for the Exploration of Complex State Spaces in the CPSO Approach. ANTS Conference 2008: 355-362 - [c3]Jörg Lässig, Karl-Heinz Hoffmann, Mihaela Enachescu:
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms. GECCO (Companion) 2008: 2181-2186 - 2007
- [c2]Jörg Lässig, Steffen Heinrich, Holger Dürr:
Generation of SME Production and Logistics Networks with Extremal Optimization and Fitness Threshold Accepting. Artificial Intelligence and Pattern Recognition 2007: 313-319 - [c1]Jörg Lässig:
Cross Company Resource and Time Assignment in a Combinatorial Auction Scenario. IICAI 2007: 743-762 - 2005
- [i1]Steffen Heinrich, Holger Dürr, T. Hanel, Jörg Lässig:
An Agent-based Manufacturing Management System for Production and Logistics within Cross-Company Regional and National Production Networks. CoRR abs/cs/0511068 (2005)
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 2024-12-02 22:35 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:
