Parallel Induction of Nondeterministic Finite Automata T Jastrzab, ZJ Czech, W Wieczorek International Conference on Parallel Processing and Applied Mathematics, 248-257, 2016 | 15 | 2016 |
On Parallel Induction of Nondeterministic Finite Automata T Jastrzab Procedia Computer Science 80, 257-268, 2016 | 15 | 2016 |
Two parallelization schemes for the induction of nondeterministic finite automata on PCs T Jastrzab Parallel Processing and Applied Mathematics: 12th International Conference …, 2018 | 13 | 2018 |
Mapping of Selected Synsets to Semantic Features T Jastrząb, G Kwiatkowski, P Sadowski International Conference: Beyond Databases, Architectures and Structures …, 2016 | 8 | 2016 |
A comparison of selected variable ordering methods for NFA induction T Jastrząb Computational Science–ICCS 2019: 19th International Conference, Faro …, 2019 | 7 | 2019 |
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference T Jastrzab, ZJ Czech, W Wieczorek Fundamenta Informaticae 178 (3), 203-227, 2021 | 6 | 2021 |
A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization A Dua, T Jastrząb, ZJ Czech, P Krömer Proceedings of the 18th ACM International Symposium on QoS and Security for …, 2022 | 5 | 2022 |
Ontology reuse as a means for fast prototyping of new concepts I Postanogov, T Jastrząb Beyond Databases, Architectures and Structures. Towards Efficient Solutions …, 2017 | 5 | 2017 |
Taking advantage of a very simple property to efficiently infer NFAs T Jastrząb, F Lardeux, E Monfroy 2022 IEEE 34th International Conference on Tools with Artificial …, 2022 | 4 | 2022 |
A Parallel Algorithm for Decomposition of Finite Languages T Jastrząb, ZJ Czech, W Wieczorek Parallel Computing: On the Road to Exascale 27, 401-410, 2016 | 4 | 2016 |
A parallel algorithm for the decomposition of finite languages T Jastrząb, ZJ Czech Studia Informatica 35 (4), 5-16, 2014 | 4 | 2014 |
Answer Set Programming for Regular Inference W Wieczorek, T Jastrzab, O Unold Applied Sciences 10 (21), 7700, 2020 | 3 | 2020 |
Inference of Over-Constrained NFA of Size to Efficiently and Systematically Derive NFA of Size k for Grammar Learning T Jastrząb, F Lardeux, E Monfroy International Conference on Computational Science, 134-147, 2023 | 2 | 2023 |
Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows M Blocho, T Jastrzab, J Nalepa Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2022 | 2 | 2022 |
A Bi-objective Genetic Algorithm for Wireless Sensor Network Optimization A Dua, P Krömer, ZJ Czech, T Jastrząb Complex, Intelligent and Software Intensive Systems: Proceedings of the 16th …, 2022 | 2 | 2022 |
Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm T Jastrzab, ZJ Czech, W Wieczorek 2020 19th International Symposium on Parallel and Distributed Computing …, 2020 | 2 | 2020 |
Practical applications of smart delivery systems: Mine evacuation as an example of rich vehicle routing problem T Jastrzab, A Buchcik Smart Delivery Systems, 249-268, 2020 | 2 | 2020 |
Enriching Keywords Database UsingWordnets–a Case Study T Jastrząb, G Kwiatkowski Proceedings of the 10th Global Wordnet Conference, 329-335, 2019 | 2 | 2019 |
eanaliza. pl—A new online service for financial analysis T Jastrząb, M Wieczorek-Kosmala, J Błach, G Kwiatkowski Multimedia and Network Information Systems: Proceedings of the 10th …, 2017 | 2 | 2017 |
Robust models to infer flexible nondeterministic finite automata T Jastrzab, F Lardeux, E Monfroy Journal of Computational Science 79, 102309, 2024 | 1 | 2024 |