default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Jastrzab
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Tomasz Jastrzab
, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Michal Kawulok, Adam Czornik, Jakub Nalepa:
Standardized validation of vehicle routing algorithms. Appl. Intell. 54(2): 1335-1364 (2024)- [j3]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Robust models to infer flexible nondeterministic finite automata. J. Comput. Sci. 79: 102309 (2024) - [c23]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Classifying Words with 3-sort Automata. ICAART (3) 2024: 1179-1188 - [c22]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Classifying Words with 3-sort Automata. SAC 2024: 787-788 - [i2]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Classifying Words with 3-sort Automata. CoRR abs/2401.01314 (2024) - 2023
- [c21]Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa:
Parallel Cooperative Memetic Co-evolution for VRPTW. GECCO Companion 2023: 53-54 - [c20]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Inference of Over-Constrained NFA of Size k+1 to Efficiently and Systematically Derive NFA of Size k for Grammar Learning. ICCS (1) 2023: 134-147 - [c19]Amit Dua, Pavel Krömer, Zbigniew J. Czech, Tomasz Jastrzab:
Genetic Algorithm with Heuristic Mutation for Wireless Sensor Network Optimization. INCoS 2023: 177-189 - [i1]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Taking advantage of a very simple property to efficiently infer NFAs. CoRR abs/2303.09311 (2023) - 2022
- [j2]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
An adaptive parallel algorithm for finite language decomposition. Appl. Intell. 52(3): 3029-3050 (2022) - [c18]Amit Dua, Pavel Krömer, Zbigniew J. Czech, Tomasz Jastrzab:
A Bi-objective Genetic Algorithm for Wireless Sensor Network Optimization. CISIS 2022: 147-159 - [c17]Miroslaw Blocho, Tomasz Jastrzab, Jakub Nalepa:
Cooperative co-evolutionary memetic algorithm for pickup and delivery problem with time windows. GECCO Companion 2022: 176-179 - [c16]Tomasz Jastrzab, Michal Myller, Lukasz Tulczyjew, Miroslaw Blocho, Wojciech Ryczko, Michal Kawulok, Jakub Nalepa:
Particle Swarm Optimization Configures the Route Minimization Algorithm. ICCS (1) 2022: 80-87 - [c15]Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Taking Advantage of a Very Simple Property to Efficiently Infer NFAs. ICTAI 2022: 1355-1361 - [c14]Amit Dua, Tomasz Jastrzab, Zbigniew J. Czech, Pavel Krömer:
A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization. Q2SWinet 2022: 87-93 - 2021
- [j1]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference. Fundam. Informaticae 178(3): 203-227 (2021) - 2020
- [c13]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm. ISPDC 2020: 37-43
2010 – 2019
- 2019
- [c12]Tomasz Jastrzab:
A Comparison of Selected Variable Ordering Methods for NFA Induction. ICCS (5) 2019: 741-748 - [c11]Tomasz Jastrzab:
On Superlinear Speedups of a Parallel NFA Induction Algorithm. PARCO 2019: 179-188 - [c10]Tomasz Jastrzab, Grzegorz Kwiatkowski:
Enriching Keywords Database UsingWordnets - a Case Study. GWC 2019: 329-335 - 2017
- [c9]Igor Postanogov, Tomasz Jastrzab:
Ontology Reuse as a Means for Fast Prototyping of New Concepts. BDAS 2017: 273-287 - [c8]Daniel Krasnokucki, Grzegorz Kwiatkowski, Tomasz Jastrzab:
A New Method of XML-Based Wordnets' Data Integration. BDAS 2017: 302-315 - [c7]Tomasz Jastrzab, Grzegorz Kwiatkowski, Pawel Sadowski, Adam Dyrek:
A Comparison of Polish Wordnets in the View of Semantic Features Mapping. ICMMI 2017: 375-386 - [c6]Tomasz Jastrzab:
Two Parallelization Schemes for the Induction of Nondeterministic Finite Automata on PCs. PPAM (1) 2017: 279-289 - 2016
- [c5]Tomasz Jastrzab, Grzegorz Kwiatkowski, Pawel Sadowski:
Mapping of Selected Synsets to Semantic Features. BDAS 2016: 357-367 - [c4]Tomasz Jastrzab:
On Parallel Induction of Nondeterministic Finite Automata. ICCS 2016: 257-268 - [c3]Tomasz Jastrzab, Monika Wieczorek-Kosmala, Joanna Blach, Grzegorz Kwiatkowski:
eanaliza.pl - A New Online Service for Financial Analysis. MISSI 2016: 343-355 - 2015
- [c2]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
A Parallel Algorithm for Decomposition of Finite Languages. PARCO 2015: 401-410 - [c1]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
Parallel Induction of Nondeterministic Finite Automata. PPAM (1) 2015: 248-257
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-08-05 20:20 CEST 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:
