Abstract
We present a simple modification to the idea of impact-based search which has proven highly effective for several applications. Impacts measure the average reduction in search space due to propagation after a variable assignment has been committed. Rather than considering the mean reduction only, we consider the idea of incorporating the variance in reduction. Experimental results show that using variance can result in improved search performance.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cambazard, H., Jussien, N.: Identifying and Exploiting Problem Structures using Explanation-Based Constraint Programming. Constraints 11(4), 295–313 (2006)
Costas, J.P.: A Study of a Class of Detection Waveforms Having Nearly Ideal Range-Doppler Ambiguity Properties. Proceedings of IEEE 72(8), 996–1009 (1984)
Freedman, A., Levanon, N.: Staggered Costas signals. IEEE Trans. Aerosp. Electron Syst. AES-22(6), 695–701 (1986)
Gomes, C.P., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274–287. Springer, Heidelberg (2004)
Gomes, C.P., Shmoys, D.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In: Proceedings of Computational Symposium on Graph Coloring and Generalizations (2002)
Golomb, S.W., Taylor, H.: Two Dimensional Synchronization Patterns for Minimum Ambiguity. IEEE Trans. Informat. Theory IT-28(4), 600–604 (1982)
Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction. Artificial Intelligence 14, 263–314 (1980)
IBM. IBM ILOG Reference manual and user manual. V6.4. IBM (2009)
Knuth, D.-E.: The Art of Computer Programming. seminumerical algorithms, vol. 2(3), p. 232. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1997)
Levente, K., Csaba, S.: Bandit Based Monte-Carlo Planning. Machine Learning ECML (2006)
Moran, J.: The Wonders of Magic Squares. Vintage, New York (1982)
Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Refalo, P.: Learning in Search. In: Hybrid Optimization. Springer, Heidelberg (2011)
Zanarini, A., Pesant, G.: Solution Counting Algorithms for Constraint-Centered Search Heuristics. Constraints 14(3), 392–413 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kadioglu, S., O’Mahony, E., Refalo, P., Sellmann, M. (2011). Incorporating Variance in Impact-Based Search. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)