19 citations · 34 across the 7 of their papers we have counts for
7 papers
The Fundamental Learning Problem that Genetic Algorithms with Uniform Crossover Solve Efficiently and Repeatedly As Evolution Proceeds
Keki M. Burjorjee
This paper establishes theoretical bonafides for implicit concurrent multivariate effect evaluation--implicit concurrency for short---a broad and versatile computational learning e…
Explaining Adaptation in Genetic Algorithms With Uniform Crossover: The Hyperclimbing Hypothesis
Keki M. Burjorjee
The hyperclimbing hypothesis is a hypothetical explanation for adaptation in genetic algorithms with uniform crossover (UGAs). Hyperclimbing is an intuitive, general-purpose, non-l…
On the Workings of Genetic Algorithms: The Genoclique Fixing Hypothesis
Keki M. Burjorjee
We recently reported that the simple genetic algorithm (SGA) is capable of performing a remarkable form of sublinear computation which has a straightforward connection with the gen…
The Fundamental Problem with the Building Block Hypothesis
Keki Burjorjee
Skepticism of the building block hypothesis (BBH) has previously been expressed on account of the weak theoretical foundations of this hypothesis and the anomalies in the empirical…
Two Remarkable Computational Competencies of the Simple Genetic Algorithm
Keki M. Burjorjee
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist…
Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm
Keki Burjorjee
The pace of progress in the fields of Evolutionary Computation and Machine Learning is currently limited -- in the former field, by the improbability of making advantageous extensi…