Local search as a fixed point of functions. In volume AIDSS, pages 431-434, 2008. abstract bibtex Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.
@inproceedings{55349139682,
abstract = "Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.",
year = "2008",
title = "Local search as a fixed point of functions",
volume = "AIDSS",
pages = "431-434",
journal = "ICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems"
}
Downloads: 0
{"_id":"yLStgyLwX6gYg6use","bibbaseid":"anonymous-localsearchasafixedpointoffunctions-2008","downloads":0,"creationDate":"2017-03-31T20:15:32.853Z","title":"Local search as a fixed point of functions","author_short":null,"year":2008,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.","year":"2008","title":"Local search as a fixed point of functions","volume":"AIDSS","pages":"431-434","journal":"ICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems","bibtex":"@inproceedings{55349139682,\n abstract = \"Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.\",\n year = \"2008\",\n title = \"Local search as a fixed point of functions\",\n volume = \"AIDSS\",\n pages = \"431-434\",\n journal = \"ICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems\"\n}\n\n","key":"55349139682","id":"55349139682","bibbaseid":"anonymous-localsearchasafixedpointoffunctions-2008","urls":{},"downloads":0,"html":""},"search_terms":["local","search","fixed","point","functions"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}