Name
Abstract | ||
|---|---|---|
In this paper, nogood recording is investigated within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to the next one. More precisely, no-goods are recorded when the current cutoff value is reached, i.e. before restarting the search algorithm. Such a set of nogoods is extracted from the last branch of the current search tree. Interestingly, the number of nogoods recorded before each new run is bounded by the length of the last branch of the search tree. As a consequence, the total number of recorded nogoods is polynomial in the number of restarts. Experiments over a wide range of CSP instances demonstrate the effectiveness of our approach. |
Year | Venue | Keywords |
|---|---|---|
2007 | IJCAI | current cutoff value,total number,search tree,csp instance,search algorithm,nogood recording,recorded nogoods,last branch,new run,current search tree |
Field | DocType | Citations |
Search algorithm,Polynomial,Computer science,Cutoff,Algorithm,Artificial intelligence,Machine learning,Search tree,Bounded function | Conference | 10 |
PageRank | References | Authors |
0.54 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christophe Lecoutre | 1 | 709 | 45.10 |
| Lakhdar Sais | 2 | 859 | 65.57 |
| Sébastien Tabary | 3 | 66 | 6.58 |
| Vincent Vidal | 4 | 108 | 6.38 |