Adam Viktorin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Adam Viktorin has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Roman Senkerik
Tomas Bata University in Zlín
100 shared publications - Michal Pluhacek
AGH University of Krakow, Kraków, Poland
94 shared publications - Tomas Kadavy
Faculty of Applied Informatics, Tomas Bata University in Zlin, Zlin, Czech Republic
70 shared publications - Zuzana Kominkova Oplatkova
Tomas Bata University in Zlín
17 shared publications - Jozef Kovac
Tomas Bata University in Zlín, Zlin, Czech Republic
13 shared publications Ivan Zelinka
VSB – Technical University of Ostrava
11 shared publications
Latest Publications
- Open Access
- 1 October 2026
- Published by Elsevier in Computer Science Review
- Vol. 63
Context matters in LLM-driven algorithm design: A controlled study in black-box optimization
- 1 October 2026
- Published by Elsevier in Computer Science Review
- Vol. 63
Open AccessContext matters in LLM-driven algorithm design: A controlled study in black-box optimization
- Open Access
- 15 September 2026
- Published by Elsevier in SSRN Electronic Journal
Solve it with EASE
This paper presents EASE (Effortless Algorithmic Solution Evolution), an open-source and fully modular framework for iterative algorithmic solution generation leveraging large language models (LLMs). EASE integrates generation, testing, analysis, and evaluation into a reproducible feedback loop, giving users full control over error handling, analysis, and quality assessment. Its architecture supports the orchestration of multiple LLMs in complementary roles - such as generator, analyst, and evaluator. By abstracting the complexity of prompt design and model management, EASE provides a transparent and extensible platform for researchers and practitioners to co-design algorithms and other generative solutions across diverse domains.
- 15 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSolve it with EASE
This paper presents EASE (Effortless Algorithmic Solution Evolution), an open-source and fully modular framework for iterative algorithmic solution generation leveraging large language models (LLMs). EASE integrates generation, testing, analysis, and evaluation into a reproducible feedback loop, giving users full control over error handling, analysis, and quality assessment. Its architecture supports the orchestration of multiple LLMs in complementary roles - such as generator, analyst, and evaluator. By abstracting the complexity of prompt design and model management, EASE provides a transparent and extensible platform for researchers and practitioners to co-design algorithms and other generative solutions across diverse domains.
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1416-1424
Could LLMs Predict Algorithm Performance in Automated Design of Metaheuristics?
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1416-1424
Open AccessCould LLMs Predict Algorithm Performance in Automated Design of Metaheuristics?
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1828-1849
Large Language Models for Metaheuristic Design: Exploring Challenges, Limitations, Tools, Benchmarking and Future Opportunities.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1828-1849
Open AccessLarge Language Models for Metaheuristic Design: Exploring Challenges, Limitations, Tools, Benchmarking and Future Opportunities.
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 9-10
EASE for LLM-Designed Evolutionary Algorithms: A GECCO 2026 Competition Entry
This paper presents the competition entry on LLM-designed evolutionary algorithms for the GNBG-generated benchmark suite. We use EASE (Effortless Algorithmic Solution Evolution), a modular framework that prompts a large language model to generate complete optimizers, evaluates them under the competition protocol, and feeds performance summaries together with improvement-oriented analysis back into subsequent iterations. The automated process produced ten valid candidate algorithms. The best generated solver was a hybrid adaptive Differential Evolution method combining L-SHADE-style parameter adaptation, archive-based diversity preservation, covariance-inspired variation, and budget-aware local refinement. The results show that iterative LLM-guided refinement can produce effective, benchmark-specific optimizers.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 9-10
Open AccessEASE for LLM-Designed Evolutionary Algorithms: A GECCO 2026 Competition Entry
This paper presents the competition entry on LLM-designed evolutionary algorithms for the GNBG-generated benchmark suite. We use EASE (Effortless Algorithmic Solution Evolution), a modular framework that prompts a large language model to generate complete optimizers, evaluates them under the competition protocol, and feeds performance summaries together with improvement-oriented analysis back into subsequent iterations. The automated process produced ten valid candidate algorithms. The best generated solver was a hybrid adaptive Differential Evolution method combining L-SHADE-style parameter adaptation, archive-based diversity preservation, covariance-inspired variation, and budget-aware local refinement. The results show that iterative LLM-guided refinement can produce effective, benchmark-specific optimizers.
- Open Access
- 17 March 2026
- Published by Elsevier in SSRN Electronic Journal
LLM-based optimization framework: An architectural overview
This paper provides a detailed analysis of the potential technical and architectural challenges associated with building the FrontEASE software. FrontEASE serves as the web wrapper, utility extension, and user interaction layer for the modular LLM-based optimization framework, EASE (Effortless Algorithmic Solution Evolution). The focus is on the architectural choices made and how this unconventional solution, designed to streamline the use of LLM-based optimization workflows for scientific applications, aligns with best practices in standard software engineering. The primary goal of this paper is to promote and facilitate further experimentation with enterprise-grade architectures for LLM-driven applications. Ultimately, this work aims to guide the development of these products into reliable and maintainable software solutions over the long term.
- 17 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLLM-based optimization framework: An architectural overview
This paper provides a detailed analysis of the potential technical and architectural challenges associated with building the FrontEASE software. FrontEASE serves as the web wrapper, utility extension, and user interaction layer for the modular LLM-based optimization framework, EASE (Effortless Algorithmic Solution Evolution). The focus is on the architectural choices made and how this unconventional solution, designed to streamline the use of LLM-based optimization workflows for scientific applications, aligns with best practices in standard software engineering. The primary goal of this paper is to promote and facilitate further experimentation with enterprise-grade architectures for LLM-driven applications. Ultimately, this work aims to guide the development of these products into reliable and maintainable software solutions over the long term.
- Open Access
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 39349-39363
A Benchmarkable Modular Tool-Augmented Chatbot Architecture for Business Use Cases
Modern business applications increasingly demand chatbots that can perform complex tasks by augmenting large language models (LLMs) with external tools and data sources. In this paper, we propose a modular and extensible chatbot architecture that integrates LLMs with tools such as relational databases, semantic search engines, and computational APIs to enhance the bot’s capabilities. A key novelty of our work is a comprehensive benchmarking methodology designed to systematically evaluate the performance of these tool-augmented chatbots across diverse tasks and scenarios. We implement the architecture using contemporary LLM technology and evaluated it on realistic business queries requiring multi-step reasoning. Experimental results demonstrate that the augmented agent can successfully handle complex queries that demand extended context, precise computation, and domain-specific knowledge-capabilities that remain challenging for a standalone LLM. The proposed architecture and guidelines are model-agnostic and future-proof: it allows new tools or more advanced LLMs to be plugged in with minimal effort, and provides a reproducible evaluation suite to measure their impact.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 39349-39363
Open AccessA Benchmarkable Modular Tool-Augmented Chatbot Architecture for Business Use Cases
Modern business applications increasingly demand chatbots that can perform complex tasks by augmenting large language models (LLMs) with external tools and data sources. In this paper, we propose a modular and extensible chatbot architecture that integrates LLMs with tools such as relational databases, semantic search engines, and computational APIs to enhance the bot’s capabilities. A key novelty of our work is a comprehensive benchmarking methodology designed to systematically evaluate the performance of these tool-augmented chatbots across diverse tasks and scenarios. We implement the architecture using contemporary LLM technology and evaluated it on realistic business queries requiring multi-step reasoning. Experimental results demonstrate that the augmented agent can successfully handle complex queries that demand extended context, precise computation, and domain-specific knowledge-capabilities that remain challenging for a standalone LLM. The proposed architecture and guidelines are model-agnostic and future-proof: it allows new tools or more advanced LLMs to be plugged in with minimal effort, and provides a reproducible evaluation suite to measure their impact.
- 11 February 2026
- Published by Springer Nature
- p. 650-665
OS-QLR: One-Shot Quantized Latent Refinement for Fast and Efficient Image Generation
- 11 February 2026
- Published by Springer Nature
- p. 650-665
OS-QLR: One-Shot Quantized Latent Refinement for Fast and Efficient Image Generation
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 7-8
EASE-ing into Global Optimization with LLMs
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 7-8
Open AccessEASE-ing into Global Optimization with LLMs
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2345-2353
Regarding Context Size in LLM-Based Metaheuristic Design
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2345-2353
Open AccessRegarding Context Size in LLM-Based Metaheuristic Design