Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
On the Power of Restarts for CSP
2010
Baptista and Azevedo 2010
The use of restart techniques in solving Constraint Satisfaction Problems (CSPs) is considered of small importance for backtrack search algorithms. In this paper we propose to conduct a preliminary study on the impact of restarts in randomized backtrack search algorithms for solving CSPs. We show that the well-know n-queens problem has a heavy-tail distribution. We present empirical evidences that restarts can effectively improve the time to solve the n-queens problem. We implement a conflict-driven variable heuristic, and present empirical evidences that this heuristic effectively improve the time to solve the n-queens problem.
In proceedings
Luís Baptista, Francisco Azevedo
Peter Nightingale, Standa Živný
Proceedings of CP2010's Doctoral Programme
-
-
-
-
7-12
-
-
-
-
Publication files
- click here to download - pdf 132 KB
Export formats
Luís Baptista and Francisco Azevedo, On the Power of Restarts for CSP, in: Peter Nightingale and Standa Živný (eds), Proceedings of CP2010's Doctoral Programme, Pag. 7-12, 2010.
<a href="/people/members/view.php?code=0ec710f4aed9065fb0a84758926e4bc2" class="author">Luís Baptista</a> and <a href="/people/members/view.php?code=f260a0cb31e0c92628691f7473b16e98" class="author">Francisco Azevedo</a>, <b>On the Power of Restarts for CSP</b>, in: Peter Nightingale and Standa Živný (eds), <u>Proceedings of CP2010's Doctoral Programme</u>, Pag. 7-12, 2010.
@inproceedings {Baptista and Azevedo 2010, author = {Lu\'{\i}s Baptista and Francisco Azevedo}, editor = {Peter Nightingale and Standa Živný}, title = {On the Power of Restarts for CSP}, booktitle = {Proceedings of CP2010's Doctoral Programme}, pages = {7-12}, abstract = {The use of restart techniques in solving Constraint Satisfaction Problems (CSPs) is considered of small importance for backtrack search algorithms. In this paper we propose to conduct a preliminary study on the impact of restarts in randomized backtrack search algorithms for solving CSPs. We show that the well-know n-queens problem has a heavy-tail distribution. We present empirical evidences that restarts can effectively improve the time to solve the n-queens problem. We implement a conflict-driven variable heuristic, and present empirical evidences that this heuristic effectively improve the time to solve the n-queens problem.}, keywords = {search, constraint, restart, randomization, heuristic}, year = {2010}, }
Publication's urls
/publications/view.php?code=5db751f97f52b18250ff18b0299eb7d9
/publications/view.php?code=Baptista and Azevedo 2010
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT