Program optimisation with dependency injection

3Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For many real-world problems, there exist non-deterministic heuristics which generate valid but possibly sub-optimal solutions. The program optimisation with dependency injection method, introduced here, allows such a heuristic to be placed under evolutionary control, allowing search for the optimum. Essentially, the heuristic is "fooled" into using a genome, supplied by a genetic algorithm, in place of the output of its random number generator. The method is demonstrated with generative heuristics in the domains of 3D design and communications network design. It is also used in novel approaches to genetic programming. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

McDermott, J., & Carroll, P. (2013). Program optimisation with dependency injection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7831 LNCS, pp. 133–144). https://doi.org/10.1007/978-3-642-37207-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free