A Value Ordering Heuristic for Weighted CSP

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Nicolas Levasseur Articles by Patrice Boizumault Articles by Samir Loudni

19th IEEE International Conference on Tools with Artificial Intelligence - Vol.1 (ICTAI 2007)

Paris, France

October 29-October 31

ISBN: 0-7695-3015-X

	ASCII Text	x
	Nicolas Levasseur, Patrice Boizumault, Samir Loudni, "A Value Ordering Heuristic for Weighted CSP," Tools with Artificial Intelligence, IEEE International Conference on, vol. 1, pp. 259-262, 19th IEEE International Conference on Tools with Artificial Intelligence - Vol.1 (ICTAI 2007), 2007.

	BibTex	x
	@article{ 10.1109/ICTAI.2007.45, author = {Nicolas Levasseur and Patrice Boizumault and Samir Loudni}, title = {A Value Ordering Heuristic for Weighted CSP}, journal ={Tools with Artificial Intelligence, IEEE International Conference on}, volume = {1}, year = {2007}, issn = {1082-3409}, pages = {259-262}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICTAI.2007.45}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Tools with Artificial Intelligence, IEEE International Conference on TI - A Value Ordering Heuristic for Weighted CSP SN - 1082-3409 SP259 EP262 A1 - Nicolas Levasseur, A1 - Patrice Boizumault, A1 - Samir Loudni, PY - 2007 VL - 1 JA - Tools with Artificial Intelligence, IEEE International Conference on ER -

Nicolas Levasseur

Patrice Boizumault

Samir Loudni

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2007.45

In this paper, we propose a new value ordering heuris- tic for Weighted Constraint Satisfaction Problems (WCSP) based on the quality of solutions. The H-Quality of an as- signment estimates its capacity at occurring in solutions of "good" quality. Experiments using Limited Discrepancy Search on random WCSP instances and CELAR bench- marks show that our value ordering always outperforms MinAC in a significant way.

Citation:

Nicolas Levasseur, Patrice Boizumault, Samir Loudni, "A Value Ordering Heuristic for Weighted CSP," ictai, vol. 1, pp.259-262, 19th IEEE International Conference on Tools with Artificial Intelligence - Vol.1 (ICTAI 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.