Skip to main content
Article thumbnail
Location of Repository

Performance measurement of interactive CSP search algorithms

By GAVANELLI M., LAMMA E., MELLO P. and MILANO M.

Abstract

The Constraint Satisfaction Problem (CSP) is a good framework for\ud dealing with combinatorial problems, but it does not take into\ud account the interactive acquisition of the problem parameters. For\ud this reason, an extension of the CSP model, the Interactive CSP\ud model, has been proposed. Various ICSP solving\ud algorithms have been discussed as well. In order to verify for\ud which kind of problems the ICSP model is most promising, we\ud performed a series of systematic tests

Year: 2000
OAI identifier: oai:iris.unife.it:11392/1204173
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/11392/12... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.