Zbigniew J. Czech

42 papers A 3B 1C 5Misc 5Journal 12Unranked 15
YearRankTypeTitle / Venue / Authors
2023 — conf
Genetic Algorithm with Heuristic Mutation for Wireless Sensor Network Optimization.
INCoS
Amit Dua, Pavel Krömer, Zbigniew J. Czech, Tomasz Jastrzab
2022 Misc conf
A Bi-objective Genetic Algorithm for Wireless Sensor Network Optimization.
CISIS
Amit Dua, Pavel Krömer, Zbigniew J. Czech, Tomasz Jastrzab
2022 — conf
A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization.
Q2SWinet
Amit Dua, Tomasz Jastrzab, Zbigniew J. Czech, Pavel Krömer
2022 J jnl
An adaptive parallel algorithm for finite language decomposition.
Appl. Intell.
Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek
2021 J jnl
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference.
Fundam. Informaticae
Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek
2020 C conf
Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm.
ISPDC
Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek
2017 — book
Introduction to Parallel Computing
Zbigniew J. Czech
2015 — conf
A Parallel Algorithm for Decomposition of Finite Languages.
PARCO
Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek
2015 — conf
Parallel Induction of Nondeterministic Finite Automata.
PPAM (1)
Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek
2014 J jnl
A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows.
CoRR
Jakub Nalepa, Zbigniew J. Czech
2013 — conf
A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows.
3PGCIC
Miroslaw Blocho, Zbigniew J. Czech
2013 — conf
Co-operation Schemes for the Parallel Memetic Algorithm.
PPAM (1)
Jakub Nalepa, Miroslaw Blocho, Zbigniew J. Czech
2013 — conf
New Selection Schemes in a Memetic Algorithm for the Vehicle Routing Problem with Time Windows.
ICANNGA
Jakub Nalepa, Zbigniew J. Czech
2012 — conf
A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows.
HPCC-ICESS
Miroslaw Blocho, Zbigniew J. Czech
2011 — conf
A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows.
PPAM (1)
Miroslaw Blocho, Zbigniew J. Czech
2009 — conf
Implementing a Parallel Simulated Annealing Algorithm.
PPAM (1)
Zbigniew J. Czech, Wojciech Mikanik, Rafal Skinderowicz
2008 A conf
Statistical measures of a fitness landscape for the vehicle routing problem.
IPDPS
Zbigniew J. Czech
2007 Misc conf
Theoretical and Practical Issues of Parallel Simulated Annealing.
PPAM
Agnieszka Debudaj-Grabysz, Zbigniew J. Czech
2006 C conf
Solving Bicriterion Optimization Problems by Parallel Simulated Annealing.
PDP
Zbigniew J. Czech, Bozena Wieczorek
2006 — conf
Speeding Up Sequential Simulated Annealing by Parallelization.
PARELEC
Zbigniew J. Czech
2005 Misc conf
Frequency of Co-operation of Parallel Simulated Annealing Processes.
PPAM
Zbigniew J. Czech, Bozena Wieczorek
2004 — conf
A Concurrent Implementation of Simulated Annealing and its Application to the VRPTW Optimization Problem.
DAPSYS
Agnieszka Debudaj-Grabysz, Zbigniew J. Czech
2003 A conf
Ant Colony Programming for Approximation Problems.
GECCO
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wieczorek
2003 Misc conf
Parallel Simulated Annealing for Bicriterion Optimization Problems.
PPAM
Piotr Czarnas, Zbigniew J. Czech, Przemyslaw Gocyla
2002 C conf
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows.
PDP
Zbigniew J. Czech, Piotr Czarnas
2002 — conf
Selection Schemes in Evolutionary Algorithms.
Intelligent Information Systems
Wojciech Wieczorek, Zbigniew J. Czech
2002 A conf
Solving Approximation Problems By Ant Colony Programming.
GECCO
Mariusz Boryczka, Zbigniew J. Czech
2002 — conf
Solving Approximation Problems by Ant Colony Programming.
GECCO Late Breaking Papers
Mariusz Boryczka, Zbigniew J. Czech
2001 C conf
Parallel Simulated Annealing for the Delivery Problem.
PDP
Zbigniew J. Czech
2001 Misc conf
Three Parallel Algorithms for Simulated Annealing.
PPAM
Zbigniew J. Czech
2000 C conf
Parallel simulated annealing for the set-partitioning problem.
PDP
Zbigniew J. Czech
1998 J jnl
Quasi-Perfect Hashing.
Comput. J.
Zbigniew J. Czech
1998 J jnl
Randomized PRAM Simulation.
Fundam. Informaticae
Zbigniew J. Czech, Wojciech Mikanik
1997 J jnl
Perfect Hashing.
Theor. Comput. Sci.
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
1996 J jnl
A Family of Perfect Hashing Methods.
Comput. J.
Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
1996 — conf
Randomized PRAM Simulation Using T9000 Transputers.
HPCN Europe
Zbigniew J. Czech, Wojciech Mikanik
1993 J jnl
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions.
Comput. J.
Zbigniew J. Czech, Bohdan S. Majewski
1993 B conf
Graphs, Hypergraphs and Hashing.
WG
George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
1993 J jnl
Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph.
Parallel Comput.
Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski
1992 J jnl
An Optimal Algorithm for Generating Minimal Perfect Hash Functions.
Inf. Process. Lett.
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
1988 J jnl
Efficient Implementation of Detection of Undefined Variables.
Comput. J.
Zbigniew J. Czech
1984 J jnl
A region analysis algorithm for the live variables problem.
Computing
Zbigniew J. Czech