Dornberger, Rolf

Profilbild
E-Mail-Adresse
Geburtsdatum
Projekt
Organisationseinheiten
Berufsbeschreibung
Nachname
Dornberger
Vorname
Rolf
Name
Dornberger, Rolf

Filter

2008 - 200932010 - 2019352020 - 202117
Filter zurücksetzen

Einstellungen

Dateien dazu vorhanden?: Nein × Autor:in: Hanne, Thomas ×

Suchergebnisse

Gerade angezeigt 1 - 10 von 55
  • Vorschaubild nicht verfügbar
    Publikation
    Improved path planning with memory efficient A* algorithm and optimization of narrow passages
    (2021) Weber, Lukas; Dornberger, Rolf; Hanne, Thomas; Abraham, Ajith; Hanne, Thomas; Castillo, Oscar; Gandhi, Niketa; Nogueira Rios, Tatiana; Hong, Tzung-Pei [in: Hybrid Intelligent Systems. 20th International Conference on Hybrid Intelligent Systems (HIS 2020), December 14-16, 2020]
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    Naïve Bayes and named entity recognition for requirements mining in job postings
    (2021) Wild, Simon; Parlar, Soyhan; Hanne, Thomas; Dornberger, Rolf [in: 2021 3rd International Conference on Natural Language Processing. Proceedings]
    This paper analyses how the required skills in a job post can be extracted. With an automated extraction of skills from unstructured text, applicants could be more accurately matched and search engines could provide better recommendations. The problem is optimized by classifying the relevant parts of the description with a multinomial naïve Bayes model. The model identifies the section of the unstructured text in which the requirements are stated. Subsequently, a named entity recognition (NER) model extracts the required skills from the classified text. This approach minimizes the false positives since the data which is analyzed is already filtered. The results show that the naïve Bayes model classifies up to 99% of the sections correctly, and the NER model extracts 65% of the skills required for a position. The accuracy of the NER model is not sufficient to be used in production. On the validation set, the performance was insufficient. A more consistent labelling guideline would be needed and more data should be annotated to increase the performance.
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    Benchmarking tabu search and simulated annealing for the capacitated vehicle routing problem
    (2021) Arockia, Amala; Lochbrunner, Markus; Hanne, Thomas; Dornberger, Rolf [in: ICCMB 2021. 2021 4th International Conference on Computers in Management and Business. Singapore, January 30-February 1, 2021]
    This paper addresses the Capacitated Vehicle Routing Problem (CVRP) consisting of a single depot and several customers that are supplied with goods by capacitated vehicles from a depot. The main objective of the vehicle routing problem is to minimize the traveled distance of all vehicles. We compare the Tabu Search (TS) and Simulated Annealing (SA) algorithm with different initial solution strategies to solve the CVRP. We run the publicly available solver on a set of benchmark problems comparing above mentioned methods and initial solutions. The results show that TS appears superior for small-sized problems, while SA has an advantage for mid-sized problems. For larger problems the preferability of a methods depends on the available run time with SA appear promising for shorter runtime and TS for longer.
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    powerGhosts & defensiveGhosts – Enhanced ghost team controller based on Ant Colony Optimization for Ms. Pac-Man
    (IEEE, 2021) Applewhite, Timothy; Kaufmann, Roger; Dornberger, Rolf; Hanne, Thomas [in: 2021 8th Intl. Conference on Soft Computing & Machine Intelligence (ISCMI 2021). November 26-27, 2021 Cairo, Egypt]
    This paper presents an improved controller based on Ant Colony Optimization for the ghost team of Ms. Pac-Man. The controller is an enhanced version of fairGhosts which is based on the ghostAnt framework. Various improvements were implemented in terms of parameters and concepts. Especially for the explorer ants, fairGhosts uses a simplified version, as the exact reasoning for the proposed concepts could not be determined in the ghostAnt framework. In this paper, two new types of ghost teams are proposed after the modifications were conducted: powerGhosts and defensiveGhosts. powerGhosts take into account the power pill aspect for stopping criteria and solution quality of the explorer ants, and defensiveGhosts additionally involve a threshold of Ms. Pac-Man’s distance to the nearest power pill for the hunter ants, so as not to be caught easily. Test results show that the powerGhosts version shows on average 15% better results than the initial fairGhosts setup, while defensiveGhosts performs equal or slightly worse than the initial implementation. It can be concluded that including the power pill aspect in the explorer ants concept shows an improved performance of the ghost team. On the other hand, the concept of distancing ghosts from Ms. Pac-Man when she is near a power pill did not result in any significant improvement.
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    Improved long-short term memory U-Net for image segmentation
    (Springer, 2021) Oller, Heide; Dornberger, Rolf; Hanne, Thomas; Thampi, Sabu M.; Krishnan, Sri; Hegde, Rajesh M.; Ciuonzo, Domenico; Hanne, Thomas; Kannan R., Jagadeesh [in: Advances in signal processing and intelligent recognition systems. 6th International Symposium, SIRS 2020, Chennai, India, October 14-17, 2020, revised selected papers]
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    Parameter selection for ant colony optimization for solving the travelling salesman problem based on the problem size
    (2021) Kempter, Philipp; Schmitz, Martin Peter; Hanne, Thomas; Dornberger, Rolf; Abraham, Ajith; Hanne, Thomas; Castillo, Oscar; Gandhi, Niketa; Nogueira Rios, Tatiane; Hong, Tzung-Pei [in: Hybrid Intelligent Systems. 20th International Conference on Hybrid Intelligent Systems (HIS 2020), December 14-16, 2020]
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    Text mining innovation for business
    (Springer, 2020) Pustulka, Elzbieta; Hanne, Thomas; Dornberger, Rolf [in: New trends in business information systems and technology. Digital innovation and digital business Transformation]
    This chapter reflects on the business innovation supported by developing text-mining solutions to meet the business needs communicated by Swiss companies. Two related projects from different industries and with different challenges are discussed in order to identify common procedures and methodologies that can be used. One of the partners, in the gig work sector, offers a platform solution for employee recruitment for temporary work. The work assessment is performed using short reviews for which a method for sentiment assessment based on machine learning has been developed. The other partner, in the financial advice sector, operates an information extraction service for business documents, including insurance policies. This requires automation in the extraction of structured information from pdf files. The common path to innovation in such projects includes business process modeling and the implementation of novel technological solutions, including text-mining techniques.
    04A - Beitrag Sammelband
  • Vorschaubild nicht verfügbar
    Publikation
    Adapting the teaching of computational intelligence techniques to improve Learning Outcomes
    (Springer, 2020) Hanne, Thomas; Dornberger, Rolf; Dornberger, Rolf [in: New trends in business information systems and technology. Digital innovation and digital business transformation]
    04A - Beitrag Sammelband
  • Vorschaubild nicht verfügbar
    Publikation
    A new hybrid bat algorithm optimizing the capacitated vehicle routing problem
    (Association for Computing Machinery, 2020) Kussmann, Simon; Godat, Yannick; Hanne, Thomas; Dornberger, Rolf [in: Proceedings of the 2020 the 3rd International Conference on Computers in Management and Business]
    The Capacitated Vehicle Routing Problem (CVRP), an extension of the Traveling Salesman Problem with two added constraints, a local depot and a capacity constraint for each vehicle, is solved by a Hybrid Bat Algorithm (HBA). This paper investigates how the standard Bat Algorithm must be extended to become a HBA being able to solve the CVRP. The Hybrid Bat Algorithm is tested and compared to three other optimization algorithms for the CVRP, the Clarke & Wright Savings Algorithm, the Holmes and Parker Algorithm, and the Fisher and Jaikumar Method. It is discussed how the HBA is able to deliver decent solutions of the CVRP.
    04B - Beitrag Konferenzschrift
  • Vorschaubild nicht verfügbar
    Publikation
    A genetic algorithm for optimizing parameters for ant colony optimization solving capacitated vehicle routing problems
    (ACM, 2020) Faust, Oliver; Mehli, Carlo; Hanne, Thomas; Dornberger, Rolf [in: ISMSI'20: Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence]
    04B - Beitrag Konferenzschrift