Show simple item record

dc.contributor.authorSouthey, Finneganen 14:29:25 (GMT) 14:29:25 (GMT)
dc.description.abstractThis dissertation explores approaches to the satisfiability problem, focusing on local search methods. The research endeavours to better understand how and why some local search methods are effective. At the root of this understanding are a set of metrics that characterize the behaviour of local search methods. Based on this understanding, two new local search methods are proposed and tested, the first, SDF, demonstrating the value of the insights drawn from the metrics, and the second, ESG, achieving state-of-the-art performance and generalizing the approach to arbitrary 0-1 integer linear programming problems. This generality is demonstrated by applying ESG to combinatorial auction winner determination. Further augmentations to local search are proposed and examined, exploring hybrids that incorporate aspects of backtrack search methods.en
dc.format.extent995042 bytes
dc.publisherUniversity of Waterlooen
dc.rightsCopyright: 2004, Southey, Finnegan. All rights reserved.en
dc.subjectComputer Scienceen
dc.subjectartificial intelligenceen
dc.subjectconstraint satisfactionen
dc.subjectconstrained optimizationen
dc.subjectlocal searchen
dc.titleAugmenting Local Search for Satisfiabilityen
dc.typeDoctoral Thesisen
dc.pendingfalseen of Computer Scienceen
uws-etd.degreeDoctor of Philosophyen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages