Add to ORKG* INRA, centre de Toulouse Diffusion du document : INRA, centre de ToulouseInternational audienc
Solving constraint optimization problems is computationally so expensive that it is often impossible...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Publie dans : Proceedings UNIF'89, Lambrecht (RFA), June 1989Available at INIST (FR), Document Suppl...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
SIGLETIB Hannover: RN 9844(477) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Inform...
SIGLEAvailable from British Library Document Supply Centre-DSC:7769.555(97/26) / BLDSC - British Lib...
The Valued Constraint Satisfaction Problem ( ) is a general framework encompassing many optimisation...
International audienceAs an extension of constraint networks, valued constraint networks (or valued ...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1990 ...
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited
DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volum
A constraint satisfaction problem requires a value, selected from a given finite domain, to be assig...
' ER ' EES R'esum'e Dans le but de d'evelopper une m'ethode g'en&...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Solving constraint optimization problems is computationally so expensive that it is often impossible...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Publie dans : Proceedings UNIF'89, Lambrecht (RFA), June 1989Available at INIST (FR), Document Suppl...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
We survey recent results on the broad family of problems that can be cast as valued constraint satis...
SIGLETIB Hannover: RN 9844(477) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Inform...
SIGLEAvailable from British Library Document Supply Centre-DSC:7769.555(97/26) / BLDSC - British Lib...
The Valued Constraint Satisfaction Problem ( ) is a general framework encompassing many optimisation...
International audienceAs an extension of constraint networks, valued constraint networks (or valued ...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1990 ...
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited
DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volum
A constraint satisfaction problem requires a value, selected from a given finite domain, to be assig...
' ER ' EES R'esum'e Dans le but de d'evelopper une m'ethode g'en&...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Solving constraint optimization problems is computationally so expensive that it is often impossible...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
Publie dans : Proceedings UNIF'89, Lambrecht (RFA), June 1989Available at INIST (FR), Document Suppl...