Zbigniew J. Czech

Proceedings of the Complex, Intelligent and Software Intensive Systems - Proceedings of the 16th International Conference on Complex, Intelligent and Software Intensive Systems (CISIS-2022), June 29, 2022

2021

Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

2020

Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Parallel and Distributed Computing, 2020

2017

Introduction to Parallel Computing

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9781316795835, 2017

2015

Parallel Induction of Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2015

A Parallel Algorithm for Decomposition of Finite Languages.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing: On the Road to Exascale, 2015

2014

A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Jakub Nalepa

CoRR, 2014

2013

Co-operation Schemes for the Parallel Memetic Algorithm.

[BibT_eX]

[DOI]

Jakub Nalepa

Proceedings of the Parallel Processing and Applied Mathematics, 2013

New Selection Schemes in a Memetic Algorithm for the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Jakub Nalepa

Proceedings of the Adaptive and Natural Computing Algorithms, 2013

A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on P2P, 2013

2012

A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE International Conference on High Performance Computing and Communication & 9th IEEE International Conference on Embedded Software and Systems, 2012

2011

A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2011

2009

Implementing a Parallel Simulated Annealing Algorithm.

[BibT_eX]

[DOI]

Wojciech Mikanik

Rafal Skinderowicz

Proceedings of the Parallel Processing and Applied Mathematics, 2009

2008

Statistical measures of a fitness landscape for the vehicle routing problem.

[BibT_eX]

[DOI]

Agnieszka Debudaj-Grabysz

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2007

Theoretical and Practical Issues of Parallel Simulated Annealing.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2007

2006

Solving Bicriterion Optimization Problems by Parallel Simulated Annealing.

[BibT_eX]

[DOI]

Bozena Wieczorek

Proceedings of the 14th Euromicro International Conference on Parallel, 2006

Speeding Up Sequential Simulated Annealing by Parallelization.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Parallel Computing in Electrical Engineering (PARELEC 2006), 2006

2005

Frequency of Co-operation of Parallel Simulated Annealing Processes.

[BibT_eX]

[DOI]

Agnieszka Debudaj-Grabysz

Bozena Wieczorek

Proceedings of the Parallel Processing and Applied Mathematics, 2005

2004

A Concurrent Implementation of Simulated Annealing and its Application to the VRPTW Optimization Problem.

[BibT_eX]

Proceedings of the Distributed and Parallel Systems: Cluster and Grid Computing (DAPSYS 2004, 2004

2003

Parallel Simulated Annealing for Bicriterion Optimization Problems.

[BibT_eX]

[DOI]

Piotr Czarnas

Przemyslaw Gocyla

Proceedings of the Parallel Processing and Applied Mathematics, 2003

Ant Colony Programming for Approximation Problems.

[BibT_eX]

[DOI]

Mariusz Boryczka

Proceedings of the Genetic and Evolutionary Computation, 2003

2002

Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows.

[BibT_eX]

[DOI]

Piotr Czarnas

Proceedings of the 10th Euromicro Workshop on Parallel, 2002

Selection Schemes in Evolutionary Algorithms.

[BibT_eX]

Proceedings of the Intelligent Information Systems 2002, 2002

Solving Approximation Problems By Ant Colony Programming.

[BibT_eX]

Mariusz Boryczka

Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

2001

Three Parallel Algorithms for Simulated Annealing.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2001

Parallel Simulated Annealing for the Delivery Problem.

[BibT_eX]

[DOI]

Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001

2000

Parallel simulated annealing for the set-partitioning problem.

[BibT_eX]

[DOI]

Proceedings of the Eight Euromicro Workshop on Parallel and Distributed Processing, 2000

1998

Randomized PRAM Simulation.

[BibT_eX]

[DOI]

Wojciech Mikanik

Fundam. Informaticae, 1998

Quasi-Perfect Hashing.

[BibT_eX]

[DOI]

Comput. J., 1998

1997

Perfect Hashing.

[BibT_eX]

[DOI]

George Havas

Theor. Comput. Sci., 1997

1996

A Family of Perfect Hashing Methods.

[BibT_eX]

[DOI]

Comput. J., 1996

Randomized PRAM Simulation Using T9000 Transputers.

[BibT_eX]

[DOI]

Wojciech Mikanik

Proceedings of the High-Performance Computing and Networking, 1996

1993

Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph.

[BibT_eX]

[DOI]

Marek Konopka

Parallel Comput., 1993

A Linear Time Algorithm for Finding Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Comput. J., 1993

Graphs, Hypergraphs and Hashing.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

An Optimal Algorithm for Generating Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

George Havas

Inf. Process. Lett., 1992

1988

Efficient Implementation of Detection of Undefined Variables.

[BibT_eX]

[DOI]

Comput. J., 1988

1984

A region analysis algorithm for the live variables problem.

[BibT_eX]

[DOI]