The Constraint Satisfaction Problem (CSP) is a good framework for dealing with combinatorial problems, but it does not take into account the interactive acquisition of the problem parameters. For this reason, an extension of the CSP model, the Interactive CSP model, has been proposed. Various ICSP solving algorithms have been discussed as well. In order to verify for which kind of problems the ICSP model is most promising, we performed a series of systematic tests.
Performance measurement of interactive CSP search algorithms
GAVANELLI, Marco;LAMMA, Evelina;MELLO, Paola;MILANO, Michela
2000
Abstract
The Constraint Satisfaction Problem (CSP) is a good framework for dealing with combinatorial problems, but it does not take into account the interactive acquisition of the problem parameters. For this reason, an extension of the CSP model, the Interactive CSP model, has been proposed. Various ICSP solving algorithms have been discussed as well. In order to verify for which kind of problems the ICSP model is most promising, we performed a series of systematic tests.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
