Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=13686289

A new approach for weighted constraint satisfaction

Author
HOONG CHUIN LAU1
[1] School of Computing, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore
Source

Constraints (Dordrecht). 2002, Vol 7, Num 2, pp 151-165 ; ref : 21 ref

CODEN
CNSTFT
ISSN
1383-7133
Scientific domain
Computer science
Publisher
Springer, Heidelberg
Publication country
Germany
Document type
Article
Language
English
Keyword (fr)
Algorithme glouton Algorithme randomisé Méthode cas pire Programmation semi définie Randomisation Satisfaction contrainte Temps polynomial Recherche locale
Keyword (en)
Greedy algorithm Randomised algorithms Worst case method Semi definite programming Randomization Constraint satisfaction Polynomial time Local search
Keyword (es)
Algoritmo glotón Método caso peor Programacíon semi definida Aleatorización Satisfaccion restricción Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence / 001D02C05 Problem solving, game playing

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
13686289

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web