@inproceedings{33750232477,
    abstract = "In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising. © Springer-Verlag Berlin Heidelberg 2006.",
    year = "2006",
    title = "Using Local Search for guiding enumeration in constraint solving",
    volume = "4183 LNCS",
    pages = "56-65",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    author = "Crawford, Broderick and Castro, Carlos Ivan and Monfroy, Éric"
}

{"_id":"QtNTKzeAg9MzFmtC6","bibbaseid":"crawford-castro-monfroy-usinglocalsearchforguidingenumerationinconstraintsolving-2006","downloads":0,"creationDate":"2017-04-03T15:16:25.543Z","title":"Using Local Search for guiding enumeration in constraint solving","author_short":["Crawford, B.","Castro, C. I.","Monfroy, É."],"year":2006,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising. © Springer-Verlag Berlin Heidelberg 2006.","year":"2006","title":"Using Local Search for guiding enumeration in constraint solving","volume":"4183 LNCS","pages":"56-65","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"propositions":[],"lastnames":["Crawford"],"firstnames":["Broderick"],"suffixes":[]},{"propositions":[],"lastnames":["Castro"],"firstnames":["Carlos","Ivan"],"suffixes":[]},{"propositions":[],"lastnames":["Monfroy"],"firstnames":["Éric"],"suffixes":[]}],"bibtex":"@inproceedings{33750232477,\n abstract = \"In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising. © Springer-Verlag Berlin Heidelberg 2006.\",\n year = \"2006\",\n title = \"Using Local Search for guiding enumeration in constraint solving\",\n volume = \"4183 LNCS\",\n pages = \"56-65\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n author = \"Crawford, Broderick and Castro, Carlos Ivan and Monfroy, Éric\"\n}\n\n","author_short":["Crawford, B.","Castro, C. I.","Monfroy, É."],"key":"33750232477","id":"33750232477","bibbaseid":"crawford-castro-monfroy-usinglocalsearchforguidingenumerationinconstraintsolving-2006","role":"author","urls":{},"downloads":0},"search_terms":["using","local","search","guiding","enumeration","constraint","solving","crawford","castro","monfroy"],"keywords":[],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}