Abstract
This chapter introduces recomputation as an essential technique for search engines. Recomputation saves space, possibly at the expense of increased runtime. Recomputation can also save time, due to an optimistic attitude to search. Saving space and time makes recomputation an ideal candidate for solving large problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2002). Recomputation. In: Schulte, C. (eds) Programming Constraint Services. Lecture Notes in Computer Science(), vol 2302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45945-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-45945-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43371-2
Online ISBN: 978-3-540-45945-3
eBook Packages: Springer Book Archive