On computing transitive-closure equivalence sets using a hybrid GA-DP approach

DOI10.1007/3-540-46117-5_96MaRDI QIDQ4408229zbMATH OpenFDO

Authors K. P. Lam, Sui-Tung Mak

Publication date 29 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2438/24380935.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Recommendations

• A parallel transitive closure computation algorithm for VLSI test generation
• scientific article; zbMATH DE number 1869978
• DNA Sequencing by Hybridization via Genetic Search
• Genetic algorithm in DNA computing: a solution to the maximal clique problem
• Optimization of FPGA configurations using parallel genetic algorithm

This page was built for publication: On computing transitive-closure equivalence sets using a hybrid GA-DP approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408229)