An Algorithm Computing the Pareto Frontier in Constraint Satisfaction Problems

 
EPrints.org
Agentlink Clearinghouse is powered by GNU EPrints developed by the School of Electronics and Computer Science of the University of Southampton.
Type: Article
Member Organisation: 107 University of Ferrara

Gavanelli, M. (2002) An Algorithm Computing the Pareto Frontier in Constraint Satisfaction Problems. AI*IA Notizie, XV (2). pp. 15-23.

Full text not available from this archive.

Deposited by Mr Sebastian Stein on 28 February 2005

Archive Staff Only: edit this record

   

AgentLink is the European Commission's IST-funded Coordination Action for Agent-Based Computing
and is coordinated by the
University of Liverpool and University of Southampton
If you encounter any problems with these pages please contact web@agentlink.org.