The University of Southampton
University of Southampton Institutional Repository

Searching with iterated maps

Searching with iterated maps
Searching with iterated maps
In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku.
0027-8424
418-423
Elser, V.
08e4cad6-438b-4250-ad2e-3511715e1860
Rankenburg, I.
97d344a1-811f-44b5-9cd9-9a6986dc7ef2
Thibault, P.
975a4c7b-6ca9-4958-b362-9eba10ab926b
Elser, V.
08e4cad6-438b-4250-ad2e-3511715e1860
Rankenburg, I.
97d344a1-811f-44b5-9cd9-9a6986dc7ef2
Thibault, P.
975a4c7b-6ca9-4958-b362-9eba10ab926b

Elser, V., Rankenburg, I. and Thibault, P. (2007) Searching with iterated maps. Proceedings of the National Academy of Sciences, 104 (2), 418-423. (doi:10.1073/pnas.0606359104).

Record type: Article

Abstract

In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku.

This record has no associated files available for download.

More information

Accepted/In Press date: 9 November 2006
e-pub ahead of print date: 3 January 2007
Published date: 2007

Identifiers

Local EPrints ID: 419325
URI: http://eprints.soton.ac.uk/id/eprint/419325
ISSN: 0027-8424
PURE UUID: 396d5b9a-d01f-4950-a2b0-cf41da32e520
ORCID for P. Thibault: ORCID iD orcid.org/0000-0003-1278-8846

Catalogue record

Date deposited: 10 Apr 2018 16:30
Last modified: 15 Mar 2024 19:07

Export record

Altmetrics

Contributors

Author: V. Elser
Author: I. Rankenburg
Author: P. Thibault ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×