Click here to skip to this page's main content.

New to the Open Library? — Learn how it works
Last edited by WorkBot
January 24, 2010 | History

Better sampling of Steiner triple systems 1 edition

Better sampling of Steiner triple systems
Danny Heap

Read

No readable version available.

Lists

You could add Better sampling of Steiner triple systems to a list if you log in.
Oh, pooh. There's no description for this book yet. Can you help?
There is only 1 edition record, so we'll show it here...  •  Add edition?

Better sampling of Steiner triple systems.

Published 2005 .
Written in English.

About the Book

Full enumeration of the Steiner Triple Systems on v points currently seems infeasible for v larger than 19, due to combinatorial explosion in the number of isomorphism classes. A reasonable alternative would be a technique for quickly finding a representative sample of STS(v)s, but existing techniques are either too slow (back-tracking), or find a sample that is not uniformly distributed with respect to STS instances (Stinson's hill-climbing algorithm). We investigate various modifications of hill-climbing to make the sample found closer to the uniform distribution over STS instances. We also consider a criterion for gauging how uniformly hill-climbing is sampling.

Edition Notes

Source: Masters Abstracts International, Volume: 44-02, page: 0933.

Thesis (M.Sc.)--University of Toronto, 2005.

Electronic version licensed for access by U. of T. users.

GERSTEIN MICROTEXT copy on microfiche (1 microfiche).

The Physical Object

Pagination
65 leaves.
Number of pages
65

ID Numbers

Open Library
OL19216522M
ISBN 10
049407177X

History Created December 11, 2009 · 2 revisions Download catalog record: RDF / JSON

January 24, 2010 Edited by WorkBot add more information to works
December 11, 2009 Created by WorkBot add works page