|
Search the dblp DataBase
Zbigniew J. Czech:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Zbigniew J. Czech, George Havas, Bohdan S. Majewski
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1992, v:43, n:5, pp:257-264 [Journal]
- Agnieszka Debudaj-Grabysz, Zbigniew J. Czech
A Concurrent Implementation of Simulated Annealing and its Application to the VRPTW Optimization Problem. [Citation Graph (0, 0)][DBLP] DAPSYS, 2004, pp:201-209 [Conf]
- Mariusz Boryczka, Zbigniew J. Czech
Solving Approximation Problems By Ant Colony Programming. [Citation Graph (0, 0)][DBLP] GECCO, 2002, pp:133- [Conf]
- Mariusz Boryczka, Zbigniew J. Czech
Solving Approximation Problems by Ant Colony Programming. [Citation Graph (0, 0)][DBLP] GECCO Late Breaking Papers, 2002, pp:39-46 [Conf]
- Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wieczorek
Ant Colony Programming for Approximation Problems. [Citation Graph (0, 0)][DBLP] GECCO, 2003, pp:142-143 [Conf]
- Zbigniew J. Czech, Wojciech Mikanik
Randomized PRAM Simulation Using T9000 Transputers. [Citation Graph (0, 0)][DBLP] HPCN Europe, 1996, pp:736-743 [Conf]
- Wojciech Wieczorek, Zbigniew J. Czech
Selection Schemes in Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP] Intelligent Information Systems, 2002, pp:185-194 [Conf]
- Zbigniew J. Czech
Speeding Up Sequential Simulated Annealing by Parallelization. [Citation Graph (0, 0)][DBLP] PARELEC, 2006, pp:349-356 [Conf]
- Zbigniew J. Czech, Piotr Czarnas
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. [Citation Graph (0, 0)][DBLP] PDP, 2002, pp:376-0 [Conf]
- Zbigniew J. Czech, Bozena Wieczorek
Solving Bicriterion Optimization Problems by Parallel Simulated Annealing. [Citation Graph (0, 0)][DBLP] PDP, 2006, pp:7-14 [Conf]
- Piotr Czarnas, Zbigniew J. Czech, Przemyslaw Gocyla
Parallel Simulated Annealing for Bicriterion Optimization Problems. [Citation Graph (0, 0)][DBLP] PPAM, 2003, pp:233-240 [Conf]
- Zbigniew J. Czech
Three Parallel Algorithms for Simulated Annealing. [Citation Graph (0, 0)][DBLP] PPAM, 2001, pp:210-217 [Conf]
- Zbigniew J. Czech, Bozena Wieczorek
Frequency of Co-operation of Parallel Simulated Annealing Processes. [Citation Graph (0, 0)][DBLP] PPAM, 2005, pp:43-50 [Conf]
- George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
Graphs, Hypergraphs and Hashing. [Citation Graph (0, 0)][DBLP] WG, 1993, pp:153-165 [Conf]
- Zbigniew J. Czech
Efficient Implementation of Detection of Undefined Variables. [Citation Graph (0, 0)][DBLP] Comput. J., 1988, v:31, n:6, pp:545-549 [Journal]
- Zbigniew J. Czech
Quasi-Perfect Hashing. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:6, pp:416-421 [Journal]
- Zbigniew J. Czech, Bohdan S. Majewski
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP] Comput. J., 1993, v:36, n:6, pp:579-587 [Journal]
- Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
A Family of Perfect Hashing Methods. [Citation Graph (0, 0)][DBLP] Comput. J., 1996, v:39, n:6, pp:547-554 [Journal]
- Zbigniew J. Czech, Wojciech Mikanik
Randomized PRAM Simulation. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1998, v:36, n:4, pp:317-336 [Journal]
- Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski
Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1993, v:19, n:9, pp:961-971 [Journal]
- Zbigniew J. Czech, George Havas, Bohdan S. Majewski
Perfect Hashing. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:182, n:1-2, pp:1-143 [Journal]
Statistical measures of a fitness landscape for the vehicle routing problem. [Citation Graph (, )][DBLP]
Parallel Simulated Annealing for the Delivery Problem. [Citation Graph (, )][DBLP]
Theoretical and Practical Issues of Parallel Simulated Annealing. [Citation Graph (, )][DBLP]
Implementing a Parallel Simulated Annealing Algorithm. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|