Operations Research Techniques in Constraint Programming
Notice bibliographique
Résumé
The past four and a half years I have been a PhD student at the CWI in Amsterdam, with great pleasure.I have carried out my research in the group PNA1, which contains researchers from operations research as well as constraint programming.This turned out to be a fertile basis for my investigations on the combination of the two fields.My supervisor, Krzysztof Apt, was working on a somewhat different research topic.To illustrate this, we have not written a single joint paper in all those years, although this is probably also due to his ethical views on science.As a result, I have performed my research rather independently, which I have appreciated very much.Nevertheless, Krzysztof has supported and advised me in many different ways.I want to thank him for his guidance and, perhaps as important, confidence.Krzysztof realized that a background in constraint programming and operations research alone is not necessarily sufficient to perform interesting research on their combination.Hence, I was sent to Bologna, to collaborate with an expert in the field: Michela Milano.I have visited Bologna several times, and these visits turned out to be very fruitful.Apart from the papers we have written together, Michela has also acted as a mentor in the research process.I believe that her influence has been very important for my development.For all this I am very grateful to her.Another pleasant aspect of my visits to Bologna has been the "working environment".I am very thankful to Andrea Lodi, Andrea Roli, Paolo Torroni, and all other members of the Drunk Brain Band for their hospitality, company, and (in some cases) interesting discussions about research issues.During the past year I have also successfully collaborated with Gilles Pesant and Louis-Martin Rousseau.I want to thank them for this experience and for hosting me for a month in Montreal.Further, I am thankful to Eric Monfroy for interesting discussions and a very enjoyable visit to Nantes.Many of the above visits would not have been possible without the support of the CWI, which I have very much appreciated.At the CWI, I have benefited enormously from the seminars and the knowledge of the members of PNA1.I want to thank all of them, in particular Bert vi Preface Gerards, Monique Laurent and Lex Schrijver, for their support.There are many other people that have made the CWI a stimulating and pleasant environment.Among them are Peter Zoeteweij, the members of PIMB (the CWI Christmas band), Pieter Jan 't Hoen, and last, but not least, Sebastian Brand, who has been an exemplary roommate.Finally, I am very grateful to Aafke for
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,014 | 0,022 |
| Méta-épidémiologie (sens strict) | 0,003 | 0,001 |
| Méta-épidémiologie (sens large) | 0,003 | 0,003 |
| Bibliométrie | 0,005 | 0,014 |
| Études des sciences et des technologies | 0,002 | 0,006 |
| Communication savante | 0,007 | 0,007 |
| Science ouverte | 0,003 | 0,004 |
| Intégrité de la recherche | 0,003 | 0,008 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,018 | 0,005 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».