2002
DOI: 10.1007/3-540-46117-5_96
|View full text |Cite
|
Sign up to set email alerts
|

On Computing Transitive-Closure Equivalence Sets Using a Hybrid GA-DP Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2005
2005
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…3 They can also be used in applications which involve highspeed broadband networks, 4 high-speed inline processing, image recognition, and the area of genome analysis. 5 The top-level architecture of a Silicon Germanium (SiGe) FPGA is shown in Fig. 1(a).…”
Section: Introductionmentioning
confidence: 99%
“…3 They can also be used in applications which involve highspeed broadband networks, 4 high-speed inline processing, image recognition, and the area of genome analysis. 5 The top-level architecture of a Silicon Germanium (SiGe) FPGA is shown in Fig. 1(a).…”
Section: Introductionmentioning
confidence: 99%