111 |
On the shortest path and minimum spanning tree problemsPettie, Seth, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.
|
112 |
Approximating shortest paths in large networks /Lorek, David Randolph. January 2005 (has links) (PDF)
Thesis (M.S.)--University of North Carolina at Wilmington, 2005. / Includes bibliographical references (leaves: leaf: 28)
|
113 |
Aspects of the Cops and Robber game played with incomplete information /Jeliazkova, Diana. January 1900 (has links)
Thesis (M.Sc.)--Acadia University, 2006. / Includes bibliographical references (leaves 142-143). Also available on the Internet via the World Wide Web.
|
114 |
Optimal search protocols /Bedrax-Weiss, Tania. January 1999 (has links)
Thesis (Ph. D.)--University of Oregon, 1999. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 206-211). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9948016.
|
115 |
Stable and crossing structuresFleiner, Tamás, January 1900 (has links)
Thesis (doctoral)--Technische Universiteit Eindhoven, 2000. / Includes summary in Dutch. Vita. Includes bibliographical references (p. [105]-110) and index.
|
116 |
Two new combinatorial problems involving dominating sets for lottery schemes /Gründlingh, Werner R. January 2004 (has links)
Thesis (Ph. D.)--University of Stellenbosch, 2004. / Includes bibliographical references. Also available via the Internet.
|
117 |
Integer programming approaches to networks with equal-split restrictionsParmar, Amandeep. January 2007 (has links)
Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008. / Nemhauser,George, Committee Member ; Gu, Zonghao, Committee Member ; Ergun, Ozlem, Committee Member ; Sokol, Joel, Committee Co-Chair ; Ahmed, Shabbir, Committee Chair.
|
118 |
A column generation approach for stochastic optimization problemsWang, Yong Min, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
|
119 |
Modelo de administração de ativos e passivos : uma abordagem de otimização estocásticaOliveira, Alan Delgado de January 2014 (has links)
Este trabalho trata de uma aplicação de programação estocástica para administração de passivos e ativos. Inicialmente, um modelo de administração de ativos e passivos utilizando valores de retorno de ativos determinísticos é formalizado, constatando-se as suas limitações, justificando-se a necessidade de abranger formalmente a incerteza inerente aos mercados financeiros. Para isso, um modelo para administração de ativos e passivos que utiliza otimização e programação estocástica baseado em uma árvore de cenários multiestágio balanceada é apresentado, descrito, e implementado. Os seus resultados determinam uma política de investimento de ativos para o instante inicial do período considerado, definindo-se também uma regra que possibilita, a partir do equilíbrio entre o patrimônio inicial e total de passivo a ser pago ao final do período considerado, estimar a probabilidade de insolvência do fundo de pensão. Além disso, realiza-se o estudo do impacto da redução de uma proxy da taxa de juros básico na composição do portfólio administrado por essas empresas. / This work discusses an application of stochastic programming for asset-liability management. Initially, a deterministic asset-liability model is formalized. Its limitations become clear which justify the need to include uncertainty in the model. Then, a stochastic programming model based on a balanced multistage scenario tree is presented, described and implemented for an asset-liability environment. The main results are: (i) an investment policy for the fund, and, (ii) the pension’s fund insolvency probability considering an initial relation between the current assets and the present value of the future liabilities. The impact of a possible reduction in interested rate on the pension’s fund optimal portfolio is also presented.
|
120 |
Combinatorial optimisation for arterial image segmentationEssa, Ehab Mohamed Mahmoud January 2014 (has links)
Cardiovascular disease is one of the leading causes of the mortality in the western world. Many imaging modalities have been used to diagnose cardiovascular diseases. However, each has different forms of noise and artifacts that make the medical image analysis field important and challenging. This thesis is concerned with developing fully automatic segmentation methods for cross-sectional coronary arterial imaging in particular, intra-vascular ultrasound and optical coherence tomography, by incorporating prior and tracking information without any user intervention, to effectively overcome various image artifacts and occlusions. Combinatorial optimisation methods are proposed to solve the segmentation problem in polynomial time. A node-weighted directed graph is constructed so that the vessel border delineation is considered as computing a minimum closed set. A set of complementary edge and texture features is extracted. Single and double interface segmentation methods are introduced. Novel optimisation of the boundary energy function is proposed based on a supervised classification method. Shape prior model is incorporated into the segmentation framework based on global and local information through the energy function design and graph construction. A combination of cross-sectional segmentation and longitudinal tracking is proposed using the Kalman filter and the hidden Markov model. The border is parameterised using the radial basis functions. The Kalman filter is used to adapt the inter-frame constraints between every two consecutive frames to obtain coherent temporal segmentation. An HMM-based border tracking method is also proposed in which the emission probability is derived from both the classification-based cost function and the shape prior model. The optimal sequence of the hidden states is computed using the Viterbi algorithm. Both qualitative and quantitative results on thousands of images show superior performance of the proposed methods compared to a number of state-of-the-art segmentation methods.
|
Page generated in 0.1278 seconds