Show simple item record

dc.contributor.authorVander Zanden, Bradley T.en_US
dc.date.accessioned2007-04-23T17:32:21Z
dc.date.available2007-04-23T17:32:21Z
dc.date.issued1988-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-910en_US
dc.identifier.urihttps://hdl.handle.net/1813/6750
dc.description.abstractConstraint equations are increasingly being used in interactive applications such as graphics, logical programming, and simulation that demand immediate feedback. To handle the performance requirements imposed by such systems constraint evaluators must use incremental satisfaction techniques. In this paper, we apply these techniques to noncircular, multilinear systems of equations. The constraint satisfaction process is divided into two phases--a planning phase that imposes a topological order on the equations and an execution phase that evaluates the equations. A planning algorithm is presented that incrementally updates this order each time the constraint system changes. This technique achieves significant performance improvements in large constraint systems since modifications generally perturb only a small portion of the topological order.en_US
dc.format.extent2270929 bytes
dc.format.extent463636 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Incremental Planning Algorithm for Ordering Equations in a Multilinear System of Constraintsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics