On the public citation graph

An Improved Reconfiguration Method for Degradable Processor Arrays Using Genetic Algorithm

0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.2001.1702openalex-snapshot
Hardware-Efficient and Highly Reconfigurable 4- and 2-Track Fault-Tolerant Designs for Mesh-Connected Arrays
inferredcites →https://doi.org/10.1016/s1383-7621(03)00041-9openalex-snapshot
An improved reconfiguration algorithm for degradable VLSI/WSI arrays
inferredcites →https://doi.org/10.1109/12.247834openalex-snapshot
Reconfiguring processor arrays using multiple-track models: the 3-track-1-spare-approach
inferredcites →https://doi.org/10.1109/12.481492openalex-snapshot
Generation of minimal vertex covers for row/column allocation in self-repairable arrays
inferredcites →https://doi.org/10.1109/12.641936openalex-snapshot
A comprehensive reconfiguration scheme for fault-tolerant VLSI/WSI array processors
inferredcites →https://doi.org/10.1109/12.862214openalex-snapshot
Fault-tolerant processor arrays based on the 1 1/2 -track switches with flexible spare distributions
inferredcites →https://doi.org/10.1109/12.862215openalex-snapshot
An efficient reconfiguration algorithm for degradable VLSI/WSI arrays
inferredcites →https://doi.org/10.1109/43.170991openalex-snapshot
Efficient reconfiguration algorithms for degradable VLSI/WSI arrays
inferredcites →https://doi.org/10.1109/43.662684openalex-snapshot
On the reconfiguration of degradable VLSI/WSI arrays
inferredcites →https://doi.org/10.1109/dftvs.2005.7openalex-snapshot
A genetic approach for the reconfiguration of degradable processor arrays
inferredcites →https://doi.org/10.1109/ftcs.1988.5341openalex-snapshot
Approaches for the repair of VLSI/WSI RRAMs by row/column deletion
inferredcites →https://doi.org/10.1109/isscc.2003.1234253openalex-snapshot
A 16-issue multiple-program-counter microprocessor with point-to-point scalar operand network
inferredcites →https://doi.org/10.1109/tim.2003.822717openalex-snapshot
A Self-Reconfigurable Hardware Architecture for Mesh Arrays Using Single/Double Vertical Track Switches
inferredcites →https://doi.org/10.1145/291069.291020openalex-snapshot
Data speculation support for a chip multiprocessor
inferredcites →https://doi.org/10.1145/378239.379048openalex-snapshot
Route packets, net wires
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/tee.22463openalex-snapshot
Efficient abstraction algorithms for accelerating reconfiguration of VLSI arrays
inferred← citeshttps://doi.org/10.1002/tee.22716openalex-snapshot
Accelerating reconfiguration for VLSI arrays with A‐Star algorithm
inferred← citeshttps://doi.org/10.1007/978-3-662-59958-7_7openalex-snapshot
A Built-In Circuit for Self-reconfiguring Mesh-Connected Processor Arrays with Spares on Diagonal
inferred← citeshttps://doi.org/10.1007/978-3-662-63170-6_3openalex-snapshot
Self-restructuring of Mesh-Connected Processor Arrays with Spares Assigned on Rotated Orthogonal Side
inferred← citeshttps://doi.org/10.1007/978-3-662-66491-9_1openalex-snapshot
Degradable Self-restructuring of Processor Arrays by Direct Spare Replacement
inferred← citeshttps://doi.org/10.1007/978-981-96-1539-1_3openalex-snapshot
2D Arrays with 2N Spares
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.01.003openalex-snapshot
Flexible scheme for reconfiguring 2D mesh-connected VLSI subarrays under row and column rerouting
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.08.005openalex-snapshot
A high-performance VLSI array reconfiguration scheme based on network flow under row and column rerouting
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102901openalex-snapshot
Reconfiguration algorithms for synchronous communication on switch based degradable arrays
inferred← citeshttps://doi.org/10.1016/j.vlsi.2021.07.004openalex-snapshot
A mathematical programming method for constructing the shortest interconnection VLSI arrays
inferred← citeshttps://doi.org/10.1109/access.2017.2765084openalex-snapshot
A Mathematical Model for Reconfiguring VLSI Subarrays Under Row and Column Rerouting
inferred← citeshttps://doi.org/10.1109/ccgrid.2015.47openalex-snapshot
Reconfigurations for Processor Arrays with Faulty Switches and Links
inferred← citeshttps://doi.org/10.1109/ispa/iucc.2017.00086openalex-snapshot
Fault-Driven Reconfiguration Algorithm for Processor Arrays
inferred← citeshttps://doi.org/10.1109/prdc.2017.24openalex-snapshot
A Built-in Circuit for Self-Repairing Mesh-Connected Processor Arrays with Spares on Diagonal
inferred← citeshttps://doi.org/10.1109/prdc.2018.00011openalex-snapshot
Degradable Restructuring of Mesh-Connected Processor Arrays with Spares on Orthogonal Sides
inferred← citeshttps://doi.org/10.1109/tcad.2023.3337196openalex-snapshot
Efficient 3-D Processor Array Reconfiguration Algorithms Based on Bucket Effect
inferred← citeshttps://doi.org/10.1109/tpds.2013.114openalex-snapshot
Constructing Sub-Arrays with ShortInterconnects from Degradable VLSI Arrays
inferred← citeshttps://doi.org/10.1109/tpds.2016.2539958openalex-snapshot
Optimal Reconfiguration of High-Performance VLSI Subarrays with Network Flow
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0194openalex-snapshot
Shortest Partial Path First Algorithm for Reconfigurable Processor Array with Faults
inferred← citeshttps://doi.org/10.1109/tvlsi.2026.3695877openalex-snapshot
System-Level Fault-Tolerant Reconfiguration of 3-D VLSI Processor Arrays Under Multicomponent Failures
inferred← citeshttps://doi.org/10.1587/elex.13.20160930openalex-snapshot
Satisfiability-based method for reconfiguring power efficient VLSI array
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.