Piotr Beling
SoftwareX, volume 26, pages 101681, March 2024, doi: https://doi.org/10.1016/j.softx.2024.101681
The paper presents BSuccinct, a collection of software focused on compact and succinct data structures that are both space and time efficient.
Piotr Beling
ACM Journal of Experimental Algorithmics, May 2023, doi: 10.1145/3596453
In the paper we study a fingerprint-based minimal perfect hash function (FMPH for short). We propose an effective method (called FMPHGO) that reduces the size of FMPH, as well as a number of implementation improvements.
Piotr Beling, Piotr Cybula, Andrzej Jaszkiewicz, Przemysław Pełka, Marek Rogalski, Piotr Sielski
22nd European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoStar/EvoCOP), April 2022, Madrid, Spain
We describe a new method for the vehicle routing problems with constraints. Instead of trying to improve the typical metaheuristics used to efficiently solve vehicle routing problems, like large neighborhood search, iterated local search, or evolutionary algorithms, we allow them to explore the deeply infeasible regions of the search space in a controlled way.
Piotr Beling
International Joint Conferences on Artificial Intelligence (IJCAI), Montral, August 19-26, 2021
Presentation of the results included in the paper On pruning search trees of impartial games, published in Artificial Intelligence.
Piotr Beling, Marek Rogalski
Artificial Intelligence, volume 283, pages 103262, March 2020, doi: 10.1016/j.artint.2020.103262
In this paper we study computing Sprague-Grundy values for short impartial games under the normal play convention. We put forward new game-agnostic methods for effective pruning search trees of impartial games.
Piotr Beling, Piotr Cybula, Andrzej Jaszkiewicz, Marek Rogalski, Piotr Sielski
20th Annual Workshop on Metaheuristics, May 15-16, 2019, Oslo, Norway
We propose a new method for the vehicle routing problems with constraints. Instead of trying to improve the typical metaheuristics used to efficiently solve vehicle routing problems, like large neighborhood search, iterated local search, or evolutionary algorithms, we allow them to explore the deeply infeasible regions of the search space in a controlled way.
Piotr Beling
IEEE Transactions on Computational Intelligence and AI in Games, volume 9, number 1, pages 76-87, March 2017, doi: 10.1109/TCIAIG.2015.2505240
In this paper, some improvements of the partition search algorithm are proposed.
Piotr Beling
Ph.D. thesis, University of Łódź, Łódź, 2016, in polish
Ph.D. thesis, prepared under the supervision of Prof. Goldstein at the University of Łódź and defended at the Łódź University of Technology in 2006.
Piotr Beling
Metody Informatyki Stosowanej, no. 3/2011 (28), pages 5-18
The paper presents a review of algorithms to efficiently solve the double dummy problem in the card game of bridge.