Add initial acknowledgement section
This commit is contained in:
parent
81d94ed55e
commit
e4143f811a
14
.vscode/ltex.dictionary.en-GB.txt
vendored
14
.vscode/ltex.dictionary.en-GB.txt
vendored
@ -39,3 +39,17 @@ SCIP
|
|||||||
QCP-Max
|
QCP-Max
|
||||||
SICStus
|
SICStus
|
||||||
Lille
|
Lille
|
||||||
|
CSIRO
|
||||||
|
Senthoo
|
||||||
|
Henk
|
||||||
|
Gleb
|
||||||
|
Flener
|
||||||
|
Jean-Noël
|
||||||
|
Linnea
|
||||||
|
Natalja
|
||||||
|
Guus
|
||||||
|
Kyron
|
||||||
|
Stuckey
|
||||||
|
Schutt
|
||||||
|
Banda
|
||||||
|
Gange
|
||||||
|
4
.vscode/ltex.hiddenFalsePositives.en-GB.txt
vendored
4
.vscode/ltex.hiddenFalsePositives.en-GB.txt
vendored
@ -371,3 +371,7 @@
|
|||||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qgls-maxsat name=Maximum Satisfiability (MaxSAT), description=An extension of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q problem class into an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
{"rule":"EN_A_VS_AN","sentence":"^\\Qgls-maxsat name=Maximum Satisfiability (MaxSAT), description=An extension of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q problem class into an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qopt-sol name=optimal solution, description=A \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for which it has been proven that other \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of higher quality, assessed using an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, do not exist.,\\E$"}
|
{"rule":"EN_A_VS_AN","sentence":"^\\Qopt-sol name=optimal solution, description=A \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for which it has been proven that other \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of higher quality, assessed using an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, do not exist.,\\E$"}
|
||||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qgls-sat name=Boolean satisfiability (SAT), description= A problem class that tries to find a valid \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for a set of Boolean Dummies subject to a logical formula.\\E$"}
|
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qgls-sat name=Boolean satisfiability (SAT), description= A problem class that tries to find a valid \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for a set of Boolean Dummies subject to a logical formula.\\E$"}
|
||||||
|
{"rule":"TOO_LONG_SENTENCE","sentence":"^\\QThis thesis is an original work of my research and contains no material which has been accepted for the award of any other degree or diploma at any university or equivalent institution and, to the best of my knowledge and belief, this thesis contains no material previously published or written by another person, except where due reference is made in the text of the thesis.\\E$"}
|
||||||
|
{"rule":"WANT","sentence":"^\\QI especially want to thank Caitlin for her love and support even when\\E$"}
|
||||||
|
{"rule":"WANT","sentence":"^\\QFinally, I would like to thank my friends and family who have kept me sane for the last four years: my mother, Saskia, was always there to support me; my father, Marco, and Natalja always helped me look forward to the future; my siblings, Bram, Guus, and Layla, my friends abroad, Dries, Johan, Mats, and Manon I especially want to thank Caitlin for her love and support when I needed it most.\\E$"}
|
||||||
|
{"rule":"WANT","sentence":"^\\QI especially want to thank Caitlin for her love and support when I needed it most.\\E$"}
|
||||||
|
@ -103,6 +103,31 @@ toc=bib,
|
|||||||
|
|
||||||
\chapter{Acknowledgements}
|
\chapter{Acknowledgements}
|
||||||
|
|
||||||
|
\noindent{}This work would not have been possible without the amazing supervision I received during my candidature.
|
||||||
|
First and foremost, I would like to thank Guido Tack.
|
||||||
|
Searching for a thousand years, I do not imagine I would find another mentor as knowledgable, kind, and patient.
|
||||||
|
I am also grateful to Peter J. Stuckey, whose insights and guidance were instrumental in my research. I will forever be envious of his ability to instantly grasp even the most complex problems.
|
||||||
|
Furthermore, I would also like to thank Andreas Schutt for always keeping an eye out for me and providing an outside perspective when it was required.
|
||||||
|
Last but not least, I thank Graeme Gange and Maria Garcia de la Banda for their advice, feedback, and contributions to my research.
|
||||||
|
I am truly honoured to have had such an excellent team guiding me on this journey.
|
||||||
|
|
||||||
|
This thesis has been funded by CSIRO’s Data61.
|
||||||
|
In addition, I give thanks to Monash University for providing an environment conducive to learning, working, and socializing.
|
||||||
|
In particular, I would like to thank my friends and colleagues at Monash University.
|
||||||
|
Their interest in my research and the always captivating discussions have on many occasions given me the motivation required to keep going.
|
||||||
|
In no particular order, I would like to thank: David, Kevin, Dora, Senthoo, Ali, Alexander, Eddie, Jason, Henk, Mark, Pierre, Daniel, Ariel, and Gleb.
|
||||||
|
|
||||||
|
I was introduced to Constraint Programming and MiniZinc by Pierre Flener when I studied at Uppsala University.
|
||||||
|
I will forever be grateful for him for introducing me to the subject and other optimizers that made the field so much fun to work in, such as Jean-Noël, Gustav, Justin, Mats, and Linnea.
|
||||||
|
|
||||||
|
Finally, I am thankful for my friends and family, who have kept me sane for the last four years:
|
||||||
|
my mother, Saskia, for the unlimited amount of support she has always offered me;
|
||||||
|
my father, Marco, and Natalja, for helping me look to the future;
|
||||||
|
my siblings, Bram, Guus, and Layla, for providing the necessary distraction from time to time;
|
||||||
|
my friends abroad, Dries, Johan, Mats, Adrian, and Manon, for staying in contact despite the awful time differences;
|
||||||
|
and the new friends I made in Australia, Kyron, Rachel, Erin, and Carl, for giving me such a warm welcome.
|
||||||
|
I especially want to thank Caitlin for her love and support when I needed it most.
|
||||||
|
|
||||||
\cleardoublepage
|
\cleardoublepage
|
||||||
\pdfbookmark{\contentsname}{Contents}
|
\pdfbookmark{\contentsname}{Contents}
|
||||||
\tableofcontents{}
|
\tableofcontents{}
|
||||||
|
Reference in New Issue
Block a user