Research Repository

Using sequences of knots as a random search

Pina-Garcia, CA and Gu, D (2011) Using sequences of knots as a random search. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

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 > Computer Science and Electronic Engineering, School of
Depositing User: Clare Chatfield
Date Deposited: 17 Dec 2012 16:49
Last Modified: 23 Jan 2019 00:16
URI: http://repository.essex.ac.uk/id/eprint/4192

Actions (login required)

View Item View Item