Pina-Garcia, CA and Gu, Dongbing (2011) Using Sequences of Knots as a Random Search. In: UNSPECIFIED, ? - ?.
Pina-Garcia, CA and Gu, Dongbing (2011) Using Sequences of Knots as a Random Search. In: UNSPECIFIED, ? - ?.
Pina-Garcia, CA and Gu, Dongbing (2011) Using Sequences of Knots as a Random Search. In: UNSPECIFIED, ? - ?.
Abstract
Fink and Mao define a knot as "a sequence of moves creating an aesthetic structure or topology, where its properties are preserved under continuous deformations" [1]. Thus, it is possible to emulate a random search behavior [5], using a set of steps that represents a knot. However, a single knot is not enough to cover a specific area, due to this lack of coverage, we suggest link several knots in order to increase the searching scope. © 2011 Springer-Verlag Berlin Heidelberg.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Published proceedings: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 17 Dec 2012 16:49 |
| Last Modified: | 24 Oct 2024 20:43 |
| URI: | http://repository.essex.ac.uk/id/eprint/4192 |