• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 264
  • 193
  • 73
  • 18
  • 5
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 640
  • 640
  • 184
  • 179
  • 177
  • 154
  • 113
  • 112
  • 110
  • 95
  • 72
  • 71
  • 68
  • 66
  • 60
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
111

Use of genetic algorithms for query improvement in information retrieval based on a vector space model

Yang, Jing-Jye. January 1993 (has links)
Thesis (Ph. D.)--University of Pittsburgh, 1993. / eContent provider-neutral record in process. Description based on print version record. Includes bibliography (leaves 216-226).
112

On the shortest path and minimum spanning tree problems

Pettie, Seth, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.
113

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)
114

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.
115

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.
116

Stable and crossing structures

Fleiner, 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.
117

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.
118

Integer programming approaches to networks with equal-split restrictions

Parmar, 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.
119

A column generation approach for stochastic optimization problems

Wang, Yong Min, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
120

Modelo de administração de ativos e passivos : uma abordagem de otimização estocástica

Oliveira, 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.

Page generated in 0.0293 seconds