Global ETD Search

21	Optimization algorithms for phylogenetic networks / Zhang, Yuanyi. January 2007 (has links) Thesis (Ph. D.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 114-125)
22	Counting for rigidity, flexibility and extensions via the pebble game algorithm / Sljoka, Adnan. January 2006 (has links) Thesis (M.Sc.)--York University, 2006. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 168-173). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR19755 Algorithms Graph algorithms
23	Techniques for reducing the disruption of superior building blocks in genetic algorithms / Corcoran, Arthur Leo, January 1994 (has links) Thesis (Ph.D.)--University of Tulsa, 1994. / Includes bibliographical references (leaves 115-123). Genetic algorithms. Algorithms.
24	Online exploration and search in graphs / Trippen, Gerhard Wolfgang. January 2006 (has links) Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2006. / Includes bibliographical references (leaves [78]-84). Also available in electronic version. Graph algorithms. Online algorithms.
25	A multi-fidelity analysis selection method using a constrained discrete optimization formulation Stults, Ian Collier. January 2009 (has links) Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2010. / Committee Chair: Mavris, Dimitri; Committee Member: Beeson, Don; Committee Member: Duncan, Scott; Committee Member: German, Brian; Committee Member: Kumar, Viren. Part of the SMARTech Electronic Thesis and Dissertation Collection.
26	Scalable temporal latent space inference for link prediction in dynamic social networks (extended abstract) Zhu, Linhong, Guo, Dong, Yin, Junming, Ver Steeg, Greg, Galstyan, Aram 04 1900 (has links) Understanding and characterizing the processes driving social interactions is one of the fundamental problems in social network research. A particular instance of this problem, known as link prediction, has recently attracted considerable attention in various research communities. Link prediction has many important commercial applications, e.g., recommending friends in an online social network such as Facebook and suggesting interesting pins in a collection sharing network such as Pinterest. This work is focused on the temporal link prediction problem: Given a sequence of graph snapshots G1, · ··, Gt from time 1 to t, how do we predict links in future time t + 1? To perform link prediction in a network, one needs to construct models for link probabilities between pairs of nodes. A temporal latent space model is proposed that is built upon latent homophily assumption and temporal smoothness assumption. First, the proposed modeling allows to naturally incorporate the well-known homophily effect (birds of a feather flock together). Namely, each dimension of the latent space characterizes an unobservable homogeneous attribute, and shared attributes tend to create a link in a network. Inference algorithms Prediction algorithms Facebook Heuristic algorithms
27	Decentralized estimation and control with applications to a modular robot Mutambara, Arthur G. O. January 1994 (has links) No description available. 629.8 Algorithms
28	Linear-size indexes for approximate pattern matching and dictionary matching Tam, Siu-lung, 譚小龍 January 2010 (has links) published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy Computer algorithms.
29	Quantifying the effects of uncertainty in building simulation Macdonald, Iain Alexander January 2002 (has links) No description available. 690 Algorithms
30	Dynamic multicast routing in the asynchronous transfer mode environment Kadirire, James January 1996 (has links) No description available. 621.3822 Algorithms

Search results