The University of Southampton
University of Southampton Institutional Repository

Optimal parameters for search using a barrier tree Markov model

Optimal parameters for search using a barrier tree Markov model
Optimal parameters for search using a barrier tree Markov model
94-113
Benfold, William
6c2d6619-9e08-4ae6-a739-a99df0abe02a
Hallam, Jonathan
ad913478-bbc8-46f0-ba3a-8567f609047a
Prügel-Bennett, Adam
b4b5930c-a20c-4f25-acd6-ebc0b0dc4250
Benfold, William
6c2d6619-9e08-4ae6-a739-a99df0abe02a
Hallam, Jonathan
ad913478-bbc8-46f0-ba3a-8567f609047a
Prügel-Bennett, Adam
b4b5930c-a20c-4f25-acd6-ebc0b0dc4250

Benfold, William, Hallam, Jonathan and Prügel-Bennett, Adam (2007) Optimal parameters for search using a barrier tree Markov model. Theoretical Computer Science, 386 (1-2), 94-113.

Record type: Article
Text
optsearch.pdf - Other
Download (371kB)

More information

Published date: 2007
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 271544
URI: https://eprints.soton.ac.uk/id/eprint/271544
PURE UUID: 42511e51-cad1-4d2b-a037-41700e8c7468

Catalogue record

Date deposited: 13 Sep 2010 09:57
Last modified: 19 Jul 2019 22:12

Export record

Contributors

Author: William Benfold
Author: Jonathan Hallam
Author: Adam Prügel-Bennett

University divisions

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 https://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.

×