Johnson, Colin G. (2004) Using tabu search and genetic algorithms in mathematics research. In: Proceedings of the Fifth International Conference on Recent Advances in Soft Computing, December 2004, Nottingham Trent University.
This paper discusses an ongoing project which uses computational heuristic search techniques such as tabu search and genetic algorithms as a tool for mathematics research. We discuss three ways in which such search techniques can be useful for mathematicians: in nding counterexamples to conjectures, in enumerating examples, and in nding sequences of transformations between two objects which are conjectured to be related. These problem-types are discussed using examples from topology.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||experimental mathematics, genetic algorithms, tabu search, heuristics, heuristic search, topology|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:01|
|Last Modified:||06 Sep 2011 01:21|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14050 (The current URI for this page, for reference purposes)|
- Depositors only (login required):