Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Lower and upper bounding"”.
-
Algebraic Approaches to Stochastic Optimization
… algebraic approaches to the shortest path and maximum flow problems in stochastic networks. The goal of the stochastic shortest path problem is to find the distribution of the shortest path length, while the goal of the stochastic maximum flow problem is to find the distribution of the …
-
Efficient algorithms for graph substructure search
Many recent applications strongly demand efficient and effective management of graph structured data such as paths, trees, and general graphs. These applications include Bioinformatics, Chemistry, Social networks, Software and Data Engineering, World Wide Web, etc. The goal of this thesis is to …
-
On the adversarial robustness of Gaussian processes
… how the distinction between model prediction and decision in Bayesian settings naturally leads us to give two different notions of adversarial robustness. The former, probabilistic adversarial robustness, is concerned with the behaviour of the posterior distribution, formally characterising …
-
Resource-Constrained Project Scheduling with Autonomous Learning Effects
… intra-project learning on optimal makespan and problem difficulty. A learning extension is proposed to the standard RCPSP scheduling problem. Multiple parameters are considered, including project size, learning frequency, and learning intensity. A test instance generator is developed to …