Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martin A. Keane

dblp:13/6940 · DBLP profile ↗
← Back
11ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 1 first-authorSystems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › reconfigurable computing
evolvable hardware
0.011998
Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming · FPGA 1998
Reconfigurable computing and FPGAs
reconfigurable computing
0.011998
Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming · FPGA 1998
Algorithms and data structures › sequence algorithms › sorting
sorting networks
0.011998
Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming · FPGA 1998

Methods — techniques the papers use, named apart from their topics

genetic programming · 0.0genetic algorithm · 0.0
YearPublicationVenuePosition
2008 Routine high-return human-competitive automated problem-solving by means of genetic programming
John R. Koza, Matthew J. Streeter, Martin A. Keane
Inf. Sci.3
2004 Routine automated synthesis of five patented analog circuits using genetic programming
John R. Koza, Martin A. Keane, Matthew J. Streeter
Soft Comput.2
2002 Routine Duplication of Post-2000 Patented Inventions by Means of Genetic Programming
Matthew J. Streeter, Martin A. Keane, John R. Koza
EuroGP2
2002 Iterative Refinement Of Computational Circuits Using Genetic Programming
Matthew J. Streeter, Martin A. Keane, John R. Koza
GECCO2
2000 Evolution of a Controller with a Free Variable Using Genetic Programming
John R. Koza, Jessen Yu, Martin A. Keane, William Mydlowec
EuroGP3
2000 Automatic Synthesis of Both the Topology and Tuning of a Common Parameterized Controller for Two Families of Plants using Genetic Programming
Martin A. Keane, Jessen Yu, John R. Koza
GECCO1
2000 Automatic Synthesis of Electrical Circuits Containing a Free Variable Using Genetic Programming
John R. Koza, Martin A. Keane, Jessen Yu, William Mydlowec
GECCO2
1999 Evolution by Means of Genetic Programming of Analog Circuits that Perform Digital Functions
Forrest H. Bennett III, John R. Koza, Martin A. Keane, Jessen Yu, William Mydlowec, Oscar Stiffelman
GECCO3
1999 Genetic programming III: darwinian invention and problem solving [Book Review]
John R. Koza, Forrest H. Bennett III, David Andre, Martin A. Keane
IEEE Trans. Evol. Comput.4
1998 Evolving Computer Programs Using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming
abstract
This paper describes how the massive parallelism of the rapidly reconfigurable Xilinx XC6216 FPGA (in conjunction with Virtual Computing's H.O.T. Works board) can be exploited to accelerate the time-consuming fitness measurement task of genetic algorithms and genetic programming. This acceleration is accomplished by embodying each individual of the evolving population into hardware in order to perform the fitness measurement task. A 16-step sorting network for seven items was evolved that has two fewer steps than the sorting network described in the 1962 O'Connor and Nelson patent on sorting networks (and the same number of steps as a 7-sorter that was devised by Floyd and Knuth subsequent to the patent and that is now known to be minimal). Other minimal sorters have been evolved.
John R. Koza, Forrest H. Bennett III, Jeffrey L. Hutchings, Stephen L. Bade, Martin A. Keane, David Andre
FPGA5
1997 Automated synthesis of analog electrical circuits by means of genetic programming
abstract
Analog circuit synthesis entails the creation of both the topology and the sizing (numerical values) of all of the circuit's components. This paper presents a single uniform approach using genetic programming for the automatic synthesis of both the topology and sizing of a suite of eight different prototypical analog circuits, including a low-pass filter, a crossover filter, a source identification circuit, an amplifier, a computational circuit, a time-optimal controller circuit, a temperature-sensing circuit, and a voltage reference circuit. The problem-specific information required for each of the eight problems is minimal and consists of the number of inputs and outputs of the desired circuit, the types of available components, and a fitness measure that restates the high-level statement of the circuit's desired behavior as a measurable mathematical quantity. The eight genetically evolved circuits constitute an instance of an evolutionary computation technique producing results on a task that is usually thought of as requiring human intelligence.
John R. Koza, Forrest H. Bennett III, David Andre, Martin A. Keane, Frank Dunlap
IEEE Trans. Evol. Comput.4