On the public citation graph
Reconfigurable architectures: A new vision for optimization problems
0 signed · 21 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-61551-2_96openalex-snapshot
Solving satisfiability problems using field programmable gate arrays: First results
inferredcites →https://doi.org/10.1016/0004-3702(92)90007-kopenalex-snapshot
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
inferredcites →https://doi.org/10.1016/0004-3702(92)90008-lopenalex-snapshot
Arc consistency: parallelism and domain dependence
inferredcites →https://doi.org/10.1109/cicc.1994.379763openalex-snapshot
RRANN: the run-time reconfiguration artificial neural network
inferredcites →https://doi.org/10.1109/fpga.1995.477414openalex-snapshot
Run time reconfiguration of FPGA for scanning genomic databases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-45234-8_48openalex-snapshot
Hardware Implementations of Real-Time Reconfigurable WSAT Variants
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_31openalex-snapshot
Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-48302-1_64openalex-snapshot
A Runtime Reconfigurable Implementation of the GSAT Algorithm
inferred← citeshttps://doi.org/10.1007/s11265-018-1435-yopenalex-snapshot
An Accelerator for Resolution Proof Checking based on FPGA and Hybrid Memory Cube Technology
inferred← citeshttps://doi.org/10.1023/a:1020594125144openalex-snapshot
Optimal Distributed Arc-Consistency
inferred← citeshttps://doi.org/10.1023/a:1024443416592openalex-snapshot
Instance-Specific Accelerators for Minimum Covering
inferred← citeshttps://doi.org/10.1109/92.920826openalex-snapshot
Solving satisfiability problems using reconfigurable computing
inferred← citeshttps://doi.org/10.1109/92.920833openalex-snapshot
A bitstream reconfigurable FPGA implementation of the WSAT algorithm
inferred← citeshttps://doi.org/10.1109/fpga.2002.1106671openalex-snapshot
Custom computing machines for the set covering problem
inferred← citeshttps://doi.org/10.1109/tc.2004.102openalex-snapshot
Reconfigurable hardware SAT solvers: a survey of systems
inferred← citeshttps://doi.org/10.1145/1150343.1150380openalex-snapshot
A fast SAT solver algorithm best suited to reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.1145/3053687openalex-snapshot
Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs
inferred← citeshttps://doi.org/10.1145/3561515openalex-snapshot
A Survey on FPGA Cybersecurity Design Strategies
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.