|
|
Eingang zum VolltextHome | Suche | Browsen |
|||||||||||||||||||||||||||||||||
|
Lizenz
Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende URN: urn:nbn:de:kobv:517-opus-41431 URL: http://opus.kobv.de/ubp/volltexte/2010/4143/ Zhou, Neng-Fa Gesellschaft für Logische Programmierung e.V.
What I have learned from all these solver competitions
Kurzfassung auf EnglischIn this talk, I would like to share my experiences gained from participating in four CSP solver competitions and the second ASP solver competition. In particular, I’ll talk about how various programming techniques can make huge differences in solving some of the benchmark problems used in the competitions. These techniques include global constraints, table constraints, and problem-specific propagators and labeling strategies for selecting variables and values. I’ll present these techniques with experimental results from B-Prolog and other CLP(FD) systems.
| ||||||||||||||||||||||||||||||||||
|
Home | Leitlinien | Impressum | Haftungsausschluss | Statistik | Universitätsverlag | Universitätsbibliothek
| ||||||||||||||||||||||||||||||||||