On the public citation graph

Towards the Design of Systolic Genetic Search

0 signed · 34 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.1002/0471739383openalex-snapshot
Parallel Metaheuristics
inferredcites →https://doi.org/10.1007/978-0-387-77610-1openalex-snapshot
Cellular Genetic Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-04843-2_4openalex-snapshot
Implementation of Parallel Genetic Algorithm Based on CUDA
inferredcites →https://doi.org/10.1007/978-3-642-12538-6_19openalex-snapshot
Cellular Genetic Algorithm on Graphic Processing Units
inferredcites →https://doi.org/10.1007/978-3-642-27549-4_48openalex-snapshot
Systolic Optimization on GPU Platforms
inferredcites →https://doi.org/10.1007/s00500-011-0695-2openalex-snapshot
Graphics processing units and genetic programming: an overview
inferredcites →https://doi.org/10.1016/j.cor.2004.03.002openalex-snapshot
Where are the hard knapsack problems?
inferredcites →https://doi.org/10.1109/2.241423openalex-snapshot
General-purpose systolic arrays
inferredcites →https://doi.org/10.1109/cec.2009.4983119openalex-snapshot
GPU-based parallel particle swarm optimization
inferredcites →https://doi.org/10.1109/cec.2010.5586219openalex-snapshot
Differential evolution algorithm on the GPU with C-CUDA
inferredcites →https://doi.org/10.1109/cec.2010.5586286openalex-snapshot
PUGACE, a cellular Evolutionary Algorithm framework on GPUs
inferredcites →https://doi.org/10.1109/hpcs.2007.17openalex-snapshot
Fast Genetic Programming and Artificial Developmental Systems on GPUs
inferredcites →https://doi.org/10.1109/ipdps.2011.170openalex-snapshot
Parallelization strategies for ant colony optimisation on GPUs
inferredcites →https://doi.org/10.1109/mc.1982.1653825openalex-snapshot
Why systolic architectures?
inferredcites →https://doi.org/10.1109/tevc.2002.800880openalex-snapshot
Parallelism and evolutionary algorithms
inferredcites →https://doi.org/10.1145/1569901.1570086openalex-snapshot
Strategies to minimise the total run time of cyclic graph based genetic programming with GPUs
inferredcites →https://doi.org/10.1145/2001858.2002031openalex-snapshot
Bitwise operations for GPU implementation of genetic algorithms
inferredcites →https://doi.org/10.1145/2001858.2002034openalex-snapshot
Implementing cartesian genetic programming classifiers on graphics processing units using GPU.NET
inferredcites →https://doi.org/10.12694/scpe.v11i3.654openalex-snapshot
Programming Massively Parallel Processors. A Hands-on Approach
inferredcites →https://doi.org/10.1287/opre.45.5.758openalex-snapshot
A Minimal Algorithm for the 0-1 Knapsack Problem
inferredcites →https://doi.org/10.1287/opre.47.4.570openalex-snapshot
Core Problems in Knapsack Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.4954openalex-snapshot
GPU‐based branch‐and‐bound method to solve large 0‐1 knapsack problems with data‐centric strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-65482-9_17openalex-snapshot
An Out-of-Core Branch and Bound Method for Solving the 0-1 Knapsack Problem on a GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-37959-8_10openalex-snapshot
New Ideas in Parallel Metaheuristics on GPU: Systolic Genetic Search
inferred← citeshttps://doi.org/10.1007/978-3-662-45523-4_55openalex-snapshot
Systolic Genetic Search for Software Engineering: The Test Suite Minimization Case
inferred← citeshttps://doi.org/10.1007/s00500-014-1363-0openalex-snapshot
Systolic genetic search, a systolic computing-based metaheuristic
inferred← citeshttps://doi.org/10.1007/s00500-015-2005-xopenalex-snapshot
Solving optimization problems using a hybrid systolic search on GPU plus CPU
inferred← citeshttps://doi.org/10.1007/s11554-014-0441-yopenalex-snapshot
An efficient systolic array grid-based structure of the robust Bayesian regularization technique for real-time enhanced imaging in uncertain remote sensing environment
inferred← citeshttps://doi.org/10.1016/b978-0-12-803738-6.00010-0openalex-snapshot
GPU computing applied to linear and mixed-integer programming
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.07.018openalex-snapshot
A Systolic Genetic Search for reducing the execution cost of regression testing
inferred← citeshttps://doi.org/10.1016/j.ins.2018.02.033openalex-snapshot
A theoretical and empirical study of the trajectories of solutions on the grid of Systolic Genetic Search
inferred← citeshttps://doi.org/10.1109/fccm.2015.64openalex-snapshot
Pipelined Genetic Propagation
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.45openalex-snapshot
Recent Advances on GPU Computing in Operations Research
inferred← citeshttps://doi.org/10.1504/ijbic.2015.073183openalex-snapshot
A general-purpose framework for FPGA-accelerated genetic algorithms
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.