Parallel constraint propagation

Simple item page
dc.contributor.authorSamosan, Sinesie Calinen_US
dc.date.accessioned2024-08-15T18:24:39Z
dc.date.available2024-08-15T18:24:39Z
dc.date.copyright2001en_US
dc.date.issued2001
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractInterval constraints is a recently developed method used in numerical computation, and has many applications, such as solving systems of non-linear equations, complex function plotting, etc. An important aspect of solving a problem in terms of interval constraints is the constraint propagation process, which aims to eliminate the inconsistent values from the candidate intervals for the unknowns by repeatedly applying the constraint contraction operator on each primitive constraint. The fact that there is no restriction regarding the order, in which the constraint contractions have to be performed, makes constraint propagation suitable for parallel computation. This thesis presents a distributed architecture for performing constraint propagation using coordination between a set of cooperative communicating agents. More specifically, the constraint propagation problem is described as a coordination of a set of cooperative agents, each agent having a very specific role in the process of solving the problem.
dc.format.extent118 pages
dc.identifier.urihttps://hdl.handle.net/1828/19758
dc.rightsAvailable to the World Wide Weben_US
dc.titleParallel constraint propagationen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
SOMOSAN_Sinesie_Calin_MSc_2001_1222163.pdf
Size:
2.83 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.