On the public citation graph

Improving the Evolvability of Digital Multipliers Using Embedded Cartesian Genetic Programming and Product Reduction

0 signed · 36 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.1007/3-540-36553-2_21openalex-snapshot
Evolving Multiplier Circuits by Training Set and Training Vector Partitioning
inferredcites →https://doi.org/10.1007/978-3-540-24650-3_17openalex-snapshot
Evolution and Acquisition of Modules in Cartesian Genetic Programming
inferredcites →https://doi.org/10.1007/978-3-540-46239-2_9openalex-snapshot
Cartesian Genetic Programming
inferredcites →https://doi.org/10.1007/978-3-540-74626-3openalex-snapshot
Evolvable systems : from biology to hardware : 7th International Conference, ICES 2007, Wuhan, China, September 21-23, 2007 : proceedings
inferredcites →https://doi.org/10.1007/s10710-019-09344-6openalex-snapshot
Genetic programming and evolvable machines at 20
inferredcites →https://doi.org/10.1023/a:1010066330916openalex-snapshot
Principles in the Evolutionary Design of Digital Circuits—Part II
inferredcites →https://doi.org/10.1109/eh.2000.869342openalex-snapshot
Scalability problems of digital circuit evolution evolvability and efficient designs
inferredcites →https://doi.org/10.1109/eh.2004.1310832openalex-snapshot
Exploring knowledge schemes for efficient evolution of hardware
inferredcites →https://doi.org/10.7551/mitpress/1109.001.0001openalex-snapshot
Advances in Genetic Programming
inferredcites →https://doi.org/10.7551/mitpress/1109.003.0012openalex-snapshot
Simultaneous Evolution of Programs and Their Control Structures
inferredcites →https://doi.org/10.7551/mitpress/2887.003.0061openalex-snapshot
Genetic Programming Exploratory Power and the Discovery of Functions

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-642-17310-3_3openalex-snapshot
Problem Decomposition in Cartesian Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-981-96-0077-9_11openalex-snapshot
Ratcheted Random Search for Self-programming Boolean Networks
inferred← citeshttps://doi.org/10.1007/s10710-008-9074-xopenalex-snapshot
Incorporating characteristics of human creativity into an evolutionary art algorithm
inferred← citeshttps://doi.org/10.1007/s10710-009-9093-2openalex-snapshot
Parallel evolution using multi-chromosome cartesian genetic programming
inferred← citeshttps://doi.org/10.1007/s11390-009-9293-5openalex-snapshot
Innovative Batik Design with an Interactive Evolutionary Art System
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.08.022openalex-snapshot
An investigation of dynamic fitness measures for genetic programming
inferred← citeshttps://doi.org/10.1016/j.eswa.2018.03.060openalex-snapshot
Evolving dynamic fitness measures for genetic programming
inferred← citeshttps://doi.org/10.1109/ahs.2007.73openalex-snapshot
MOVES: A Modular Framework for Hardware Evolution
inferred← citeshttps://doi.org/10.1109/bracis.2018.00033openalex-snapshot
Cartesian Genetic Programming with Crossover for Designing Combinational Logic Circuits
inferred← citeshttps://doi.org/10.1109/cec.2008.4631113openalex-snapshot
Investigating the Baldwin effect on Cartesian Genetic Programming efficiency
inferred← citeshttps://doi.org/10.1109/tevc.2007.903549openalex-snapshot
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming
inferred← citeshttps://doi.org/10.1145/1143997.1144153openalex-snapshot
A multi-chromosome approach to standard and embedded cartesian genetic programming
inferred← citeshttps://doi.org/10.1145/1143997.1144154openalex-snapshot
Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems
inferred← citeshttps://doi.org/10.1145/1274000.1274009openalex-snapshot
Incorporating characteristics of human creativity into an evolutionary art algorithm
inferred← citeshttps://doi.org/10.1145/1388969.1389075openalex-snapshot
Cartesian genetic programming
inferred← citeshttps://doi.org/10.1145/1389095.1389334openalex-snapshot
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
inferred← citeshttps://doi.org/10.1145/1570256.1570428openalex-snapshot
Cartesian genetic programming
inferred← citeshttps://doi.org/10.1145/1830761.1830924openalex-snapshot
Cartesian genetic programming
inferred← citeshttps://doi.org/10.1145/2001858.2002136openalex-snapshot
GECCO 2011 tutorial
inferred← citeshttps://doi.org/10.1145/2330784.2330932openalex-snapshot
GECCO 2012 tutorial
inferred← citeshttps://doi.org/10.1145/2464576.2464578openalex-snapshot
GECCO 2013 tutorial
inferred← citeshttps://doi.org/10.1145/2739482.2756571openalex-snapshot
Cartesian Genetic Programming
inferred← citeshttps://doi.org/10.1145/3275518openalex-snapshot
Recent Developments in Cartesian Genetic Programming and its Variants
inferred← citeshttps://doi.org/10.3837/tiis.2019.04.002openalex-snapshot
A Survey of Genetic Programming and Its Applications
inferred← citeshttps://doi.org/10.4018/ijncr.2014100104openalex-snapshot
Developments on the Regulatory Network Computational Device
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.