Skip to main content Accessibility help
×
Home
Hostname: page-component-5c569c448b-6g96d Total loading time: 0.24 Render date: 2022-07-05T16:28:30.480Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Improving intervals1

Published online by Cambridge University Press:  07 November 2008

W. Ken Jackson
Affiliation:
School of Computing Science, Simon Fraser University, Burnaby, British Columbia, CanadaV5A 1S6 (e-mail: jackson@cs.sfu.ca)
F. Warren Burton
Affiliation:
School of Computing Science, Simon Fraser University, Burnaby, British Columbia, CanadaV5A 1S6 (e-mail: jackson@cs.sfu.ca)
Rights & Permissions[Opens in a new window]

Abstract

HTML view is not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show how improving values (Burton, 1991) can be extended to handle both upper and lower bounds. The result is a new data type, called improving intervals. We give a simple implementation of improving intervals that uses a list of successively tighter bounds to represent a value. A program using improving intervals can be evaluated as a parallel program using speculative evaluation. The utility of improving intervals is demonstrated through two programs: parallel alpha-beta and parallel branch-and-bound

Type
Articles
Copyright
Copyright © Cambridge University Press 1993

References

Akl, S., Barnard, D. and Doran, R. 1982. Design, analysis and implementation of a parallel tree search algorithm. IEEE Trans. Pattern Analysis & Machine Intelligence, 4(2): 192203.CrossRefGoogle ScholarPubMed
Bird, R. and Wadler, P. 1988. Introduction to Functional Programming. Prentice Hall.Google Scholar
Bird, R. S. and Hughes, J. 1987. The alpha-beta algorithm: An exercise in program transformation. Inf. Process. Lett., 24: 5357.CrossRefGoogle Scholar
Burton, F. W. 1985. Speculative computation, parallelism, and functional programming. IEEE Trans. Comput., 34(12): 11901193.CrossRefGoogle Scholar
Burton, F. W. 1991. Encapsulating nondeterminacy in an abstract data type with deterministic semantics. J. Functional Programming. 1(1): 320.CrossRefGoogle Scholar
Burton, F. W. and Jackson, W. K. 1990. Partially deterministic functions. IV Higher Order Workshop, Springer-Verlag Workshops in Computing, pp 110, Banff, Canada101409, Graham, Birtwistle (Ed.).Google Scholar
Hughes, J. 1989. Why functional programming matters. Comput. J., 32(2): 98107.CrossRefGoogle Scholar
Lai, T.-H. and Sahni, S. 1984. Anomalies in parallel branch-and-bound algorithms. Commun. ACM, 27(6): 594602.CrossRefGoogle Scholar
Li, G.-J. and Wah, B. W. 1990. Computational efficiency of parallel combinatorial or-tree searches. IEEE Trans. Softw. Eng., 16(1): 1331.Google Scholar
Powley, C., Ferguson, C. and Korf, R. E. 1989. Parallel heuristic search: Two approaches. In Kumar, V., Gopalakrishnan, P. and Kanal, L. N., editors, Parallel Algorithms for Machine Intelligence and Vision, pp. 4265. Springer-Verlag.Google Scholar
Turner, D. A. 1986. An overview of Miranda. SIGPLAN Notices, 21(12): 158166.CrossRefGoogle Scholar
Submit a response

Discussions

No Discussions have been published for this article.
You have Access

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Improving intervals1
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Improving intervals1
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Improving intervals1
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *