Log in

Relevant bibliographies by topics / "On the Paths of Turksib" / Dissertations / Theses

To see the other types of publications on this topic, follow the link: "On the Paths of Turksib".

Dissertations / Theses on the topic '"On the Paths of Turksib"'

Author: Grafiati

Published: 7 June 2025

Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic '"On the Paths of Turksib".'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Erdman, Michael. "Divergent paths : a comparative analysis of Soviet and Turkish historical narratives of Central Asia, 1922-1937." Thesis, SOAS, University of London, 2018. http://eprints.soas.ac.uk/30298/.

Full text

Abstract:

The period between the end of the Russian Civil War and Turkish War of Independence (1922) and the start of the Great Terror (1937) was one of social and political upheaval, as well as state formation according to bold new patterns across Eurasia. As part of this dynamic, both the Turkish and Soviet governments sought to refashion the self-identification of their citizens through new national histories. These meta-narratives were intended to educate as well as indoctrinate, setting new rules and boundaries for inclusion and participation. Through my doctoral project, I problematize the role of

APA, Harvard, Vancouver, ISO, and other styles

2

Shinn, Tong-Wook. "Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication." Thesis, University of Canterbury. Computer Science and Software Engineering, 2014. http://hdl.handle.net/10092/9740.

Full text

Abstract:

We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of the SP problem, the BP problem, and matrix multiplication. For the topic of matrix multiplication we show that on an n-by-n two dimensional (2D) square mesh array, two n-by-n matrices can be multiplied

APA, Harvard, Vancouver, ISO, and other styles

3

Ogrodnik, Marcel Bogdan. "Markovian rough paths." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/51500.

Full text

Abstract:

The accumulated local p-variation functional, originally presented by Cass et al. (2013), arises naturally in the theory of rough paths in estimates both for solutions to rough differential equations (RDEs), and for the higher-order terms of the signature (or Lyons lift). In stochastic examples, it has been observed that the tails of the accumulated local p-variation functional typically decay much faster than the tails of classical p-variation. This observation has been decisive, e.g. for problems involving Malliavin calculus for Gaussian rough paths as illustrated in the work by Cass et al.

APA, Harvard, Vancouver, ISO, and other styles

4

Orozco, Eric 1972. "Three paths to Zion." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30223.

Full text

Abstract:

Thesis (M. Arch.)--Massachusetts Institute of Technology, Dept. of Architecture, 2005.<br>Includes bibliographical references (p. 69-71).<br>This thesis project pursues the strategies to create urban design interventions that preserve and encourage multi-religious harmony in the contested sacred topography of Jerusalem. First, I observed the environmental and social qualities of religious coexistence by studying a pilgrimage site in Jerusalem currently shared by groups from the three monotheistic faiths, the Masjid al-Nabi Da'ud (the Mosque of the Prophet David) on Jerusalem's present-day Mt.

APA, Harvard, Vancouver, ISO, and other styles

5

Spatscheck, Oliver. "Escort: Securing scout paths." Diss., The University of Arizona, 1999. http://hdl.handle.net/10150/289020.

Full text

Abstract:

It is becoming increasingly common to find special-purpose communication devices--Information Appliances--attached to the Internet. Information appliances include network-attached disks, cameras, and displays; web and file servers; set-top boxes; application routers and firewalls. Many of these systems perform mission critical functions, like company web servers or firewalls, but are built on general purpose operating systems that do not protect them with adequate security measures. This work introduces Escort, a security architecture for the Scout operating system. Escort provides a set of m

APA, Harvard, Vancouver, ISO, and other styles

6

Magrans, Fontrodona Francesc Xavier. "Vibroacoustic coupling and transmission paths." Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/664633.

Full text

Abstract:

This dissertation deals with four topics. The first three are in the same environment, the transmission paths. The fourth refers to the synthesis of subsystems and more specifically to two subsystems linked by any number of elastic elements. In the first topic it is proved that the solution of any linear mechanical system can be expressed as a linear combination of signal transmission paths. This is done in the framework of the Global Transfer Direct Transfer (GTDT) formulation for vibroacoustic problems. Transmission paths are expressed as powers of the transfer matrix. The key idea of the

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Hong Jun. "Towards online shortest paths computation." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550689.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chénier, Christian. "Shortest paths in weighted polygons." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/10034.

Full text

Abstract:

Consider a polygon P and two points $p,\ q\in P.$ Suppose that to move from p to q, we can travel along the edges of P or through the interior of P. Assume that the speed at which we can travel along the edges of P is one unit per second, and the travel speed through the interior of P is 1/s units per seconds ($s>1$). The problem consists of finding the shortest path between p and q. We solve this problem in O(n) time for convex polygons. For simple polygons, we show two algorithms. The first algorithm runs in O(E log n) time using O(E) space (where E is the size of the visibility of P). The s

APA, Harvard, Vancouver, ISO, and other styles

9

Sheppardson, Laura. "Disjoint paths in planar graphs." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/29862.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gao, Guo-Gang. "Planning shortest paths amongst discs." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=64080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Arrayas, Manuel. "Optimal paths and large fluctuations." Thesis, Lancaster University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286978.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Victoir, Nicolas B. "From cubature to rough paths." Thesis, University of Oxford, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Moffat, Alistair. "Fast algorithms for shortest paths." Thesis, University of Canterbury. Computer Science, 1985. http://hdl.handle.net/10092/7926.

Full text

Abstract:

The problem of finding all shortest paths in a non-negatively weighted directed graph is addressed, and a number of new algorithms for solving this problem on a graph of n vertices and m edges are given. The first of these requires in the worst case min { 2mn, nᶟ } + O(n²˙⁵ ) addition and binary comparisons on path and edge costs, improving the previous bound (Dantzig, 1960) of n³ + O(n²logn) operations in a computational model where addition and comparison are the only operations permitted on path costs. The second algorithm presented, and the main result of this thesis, has an expected

APA, Harvard, Vancouver, ISO, and other styles

14

Watson, Derrick L. "Poietic hermeneutics : making local paths." Thesis, University of Chester, 2017. http://hdl.handle.net/10034/620601.

Full text

Abstract:

This thesis argues for poietic hermeneutics as a work of gathering and re-siting which intervenes in the local material-discursive site. This is an interruptive tactic of the local church, seeking the flourishing of here through transitory, non-hegemonic acts of re-making. In developing this tactic I draw a critique of a practical theology discourse which, I argue, masks acts of making, with a consequent loss of attentiveness to materiality and a normative commitment to the development of practices internal to the church and the practitioner.

APA, Harvard, Vancouver, ISO, and other styles

15

Parandehgheibi, Marzieh. "Survivable paths in multilayer networks." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/72646.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (p. 75-77).<br>We consider the problem of protection in multilayer networks. In single-layer net- works, a pair of disjoint paths

APA, Harvard, Vancouver, ISO, and other styles

16

Bagula, Bigomokero Antoine. "Traffic engineering label switched paths." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/53196.

Full text

Abstract:

Thesis (MSc)--Stellenbosch University, 2002.<br>ENGLISH ABSTRACT: The Internet is evolving into a commercial platform requiring enhanced protocols and an expanded physical infrastructure allowing a better delivery from IP. Multi-protocol Label Switching (MPLS) is a technology enabling traffic engineering and virtual private network (VPN) provisioning. MPLS achieves traffic engineering by carrying the traffic over virtual connections called Label Switched Paths (LSPs) which are engineered based on QoS requirements such as delay, jitter and packet loss minimization or throughput maximizati

APA, Harvard, Vancouver, ISO, and other styles

17

Zanganeh, Mohammad. "Experimental investigation of crack paths." Thesis, University of Sheffield, 2009. http://etheses.whiterose.ac.uk/14645/.

Full text

Abstract:

The knowledge of crack path mechanism could improve the safety issues, design and finally reduce the cost of the maintenance or production of structures in aerospace and energy industries. However, the physical mechanism behind the crack path development is not still completely understood although many criteria have been developed to predict the crack path. It is even more challenging to predict the crack trajectory in areas such as multi site damage zones where there are interactions between cracks. A study has been undertaken on sets of cracks with different interaction properties, both nume

APA, Harvard, Vancouver, ISO, and other styles

18

Boutaib, Youness. "Lipschitz geometry and rough paths." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:ebd0dfdb-fd8f-42fa-80f7-7707df695117.

Full text

Abstract:

Motivated by building a Lipschitz structure on the reachability set of a set of rough differential equations, we study first Lipschitz maps in full detail and in many aspects: we show embedding properties of Lipschitz spaces, study algebraic properties, local versus global behaviour of Lipschitz maps, give a version of the inverse function and the constant rank theorems and analyse flows of Lipschitz vector fields. Along the way, we give quantitative estimates, which is, after all, one of the main strengths of the Lipschitz geometry. Second, we combine our observations on the local properties

APA, Harvard, Vancouver, ISO, and other styles

19

Tapia, Nikolas. "Directed polymers and rough paths." Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS363.

Full text

Abstract:

Les Équations aux Dérivées Partielles Stochastiques (SPDE en anglais) sont un outil essentiel pour l'analyse des limites d'échelle de divers modèles microscopiques provenant d'autres aires des sciences telles que la physique ou la chimie. Ce type d'équations corresponds à une équations aux dérivées partielles classique à laquelle on a ajouté un terme de force externe aléatoire qui est très irrégulier ; l'exemple le plus basique est peut-être l'Équation de la Chaleur Stochastique, qui est étudiée dans une de ses version dans cette thèse. L'irrégularité du potentiel fait que l'analyse des soluti

APA, Harvard, Vancouver, ISO, and other styles

20

Wolek, Artur. "Optimal Paths in Gliding Flight." Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/52783.

Full text

Abstract:

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minim

APA, Harvard, Vancouver, ISO, and other styles

21

Benson, Pamela L. "Confucianism: three paths toward modernization." Thesis, Boston University, 1995. https://hdl.handle.net/2144/27593.

Full text

Abstract:

Boston University. University Professors Program Senior theses.<br>PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.<br>2031-01-02

APA, Harvard, Vancouver, ISO, and other styles

22

Tapia, Muñoz Nikolas Esteban. "Directed polymers and rough paths." Tesis, Universidad de Chile, 2018. http://repositorio.uchile.cl/handle/2250/168153.

Full text

Abstract:

Tesis para optar al grado de Doctor en Ciencias de la Ingeniería, Mención Modelación Matemática<br>Las Ecuaciones Estocásticas en Derivadas Parciales (SPDEs por su sigla en inglés) son una herramienta esencial para el análisis de los límites de escalamiento de diversos modelos microscópicos provenientes de otras áreas de las ciencias tales como la física y la química. Este tipo de ecuaciones corresponde a una ecuación en derivadas parciales clásica a la cual se le ha agregado un término de forzamiento externo aleatorio el que suele ser muy irregular; el ejemplo más sencillo es tal vez la Ecua

APA, Harvard, Vancouver, ISO, and other styles

23

Estori, Francesca Maria <1995&gt. "Sustainability Reporting: Paths Towards Standardization." Master's Degree Thesis, Università Ca' Foscari Venezia, 2021. http://hdl.handle.net/10579/19699.

Full text

Abstract:

This thesis aims at reviewing the progress made in the field of disclosure of sustainability measures, identifying the reasons why their development constitutes the basis for the transition to a low-carbon economy, exploring currently available options and analysing investors’ response to transparency and efficiency in this area. The work analyzes both external sustainability reports and how disclosure of new factors can be integrated into existing metrics.

APA, Harvard, Vancouver, ISO, and other styles

24

Roulin, Thibaud. "Strategic Paths of Private Equity Firms." St. Gallen, 2008. http://www.biblio.unisg.ch/org/biblio/edoc.nsf/wwwDisplayIdentifier/04605051001/$FILE/04605051001.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pensaert, William. "Hamilton Paths in Generalized Petersen Graphs." Thesis, University of Waterloo, 2002. http://hdl.handle.net/10012/1198.

Full text

Abstract:

This thesis puts forward the conjecture that for <i>n</i> > 3<i>k</i> with <i>k</i> > 2, the generalized Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and it is Hamilton-connected otherwise. We take the first step in the proof of this conjecture by proving the case <i>n</i> = 3<i>k</i> + 1 and <i>k</i> greater than or equal to 1. We do this mainly by means of an induction which takes us from <i>GP</i>(3<i>k</i> + 1, <i>k</i>) to <i>GP</i>(3(<i>k</i> + 2) + 1, <i>k</i> + 2). The induction takes the form of mapping a Hamilton path in

APA, Harvard, Vancouver, ISO, and other styles

26

Hippchen, Thomas. "Intersections of Longest Paths and Cycles." Digital Archive @ GSU, 2008. http://digitalarchive.gsu.edu/math_theses/53.

Full text

Abstract:

It is a well known fact in graph theory that in a connected graph any two longest paths must have a vertex in common. In this paper we will explore what happens when we look at k - connected graphs, leading us to make a conjecture about the intersection of any two longest paths. We then look at cycles and look at what would be needed to improve on a result by Chen, Faudree and Gould about the intersection of two longest cycles.

APA, Harvard, Vancouver, ISO, and other styles

27

Wang, I.-Lin. "Shortest paths and multicommodity network flows." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Martin, Russell Andrew. "Paths, sampling, and markov chain decomposition." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/29383.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Williams, David Robert Emlyn. "Differential equations driven by discontiuous paths." Thesis, Imperial College London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Al-Abri, Fatma. "Life-paths of educated Omani Women." Thesis, University of Liverpool, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.494172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Minimum Path Bases and Relevant Paths." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1214/1/document.pdf.

Full text

Abstract:

Given an undirected graph G(V,E) and a vertex subset U\subseteq V the U-space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U-space. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

32

Tabatabai, Bijan Oni. "An investigation of shortest paths algorithms." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/6685/.

Full text

Abstract:

In this work, we classify the shortest path problems, review all source algorithms and analyse the different implementations of single source algorithms using various list structures and labelling techniques. Furthermore, we study the Sensitivity Analysis of one-to-all problems and present an algorithm, Senet, for their Post Optimality Analysis. Senet determines all the critical values for the weight of an arc (which could be optimal, non-optimal or non-existant) at which the optimal solution changes. Senet also provides the updated optimal solution for every range formed by two successive cri

APA, Harvard, Vancouver, ISO, and other styles

33

Kleinberg, Jon M. "Approximation algorithms for disjoint paths problems." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11013.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.<br>Includes bibliographical references (p. 179-188).<br>by Jon Michael Kleinberg.<br>Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

34

Yamanami, Kenji 1972. "Leverages firms used in growing paths." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17875.

Full text

Abstract:

Thesis (S.M.M.O.T.)--Massachusetts Institute of Technology, Sloan School of Management, Management of Technology Program, 2004.<br>Includes bibliographical references (leaves 85-86).<br>Over 99% of enterprises in US and Japan are of small- or medium-size. Some will enjoy successful growth whereas most will suffer from poor growth, though all have started from being small. Analogy exists between those successfully growing start-ups and people who want to leverage the days spent in noted universities to a better job and to leverage the experiences in the better workplace to their further busines

APA, Harvard, Vancouver, ISO, and other styles

35

Kurauchi, Andrew Toshiaki Nakayama. "EyeSwipe: text entry using gaze paths." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03072018-151733/.

Full text

Abstract:

People with severe motor disabilities may communicate using their eye movements aided by a virtual keyboard and an eye tracker. Text entry by gaze may also benefit users immersed in virtual or augmented realities, when they do not have access to a physical keyboard or touchscreen. Thus, both users with and without disabilities may take advantage of the ability to enter text by gaze. However, methods for text entry by gaze are typically slow and uncomfortable. In this thesis we propose EyeSwipe as a step further towards fast and comfortable text entry by gaze. EyeSwipe maps gaze paths into wor

APA, Harvard, Vancouver, ISO, and other styles

36

AraÃjo, Rafael Teixeira de. "Convexities convexities of paths and geometric." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12104.

Full text

Abstract:

FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgico<br>In this dissertation we present complexity results related to the hull number and the convexity number for P3 convexity. We show that the hull number and the convexity number are NP-hard even for bipartite graphs. Inspired by our research in convexity based on paths, we introduce a new convexity, where we defined as convexity of induced paths of order three or P∗ 3 . We show a relation between the geodetic convexity and the P∗ 3 convexity when the graph is a join of a Km with a non-complete graph. We did rese

APA, Harvard, Vancouver, ISO, and other styles

37

Ray, Grady Dale. "Exogenous Influences and Paths To Activism." Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2453/.

Full text

Abstract:

The focus of this research was to ascertain the indirect effects upon activism of intervening variables and recognized exogenous influences upon activism. In addition, this research also focused upon the differences and similarities of a recruited activist model and spontaneous activist model. Regression and path analysis were used to measure the direct and indirect effects of the exogenous and intervening variables. This research found that when the intervening variables, political interest, political awareness, exposure to media, altruism, and self-interest were introduced to both the recrui

APA, Harvard, Vancouver, ISO, and other styles

38

Hoens, T. Ryan. "Counting and sampling paths in graphs /." Online version of thesis, 2008. http://hdl.handle.net/1850/7545.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Guidolin, Massimo. "Asset prices on Bayesian learning paths /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9975886.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Garcia, Renan. "Resource constrained shortest paths and extensions." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28268.

Full text

Abstract:

Thesis (M. S.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.<br>Committee Co-Chair: George L. Nemhauser; Committee Co-Chair: Shabbir Ahmed; Committee Member: Martin W. P. Savelsbergh; Committee Member: R. Gary Parker; Committee Member: Zonghao Gu.

APA, Harvard, Vancouver, ISO, and other styles

41

Lorek, David Randolph. "Approximating shortest paths in large networks /." Electronic version (PDF), 2005. http://dl.uncw.edu/etd/2005/lorekd/davidlorek.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Alegria, Linda V. "Radio Number for Fourth Power Paths." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/112.

Full text

Abstract:

A path on n vertices, denoted by Pn, is a simple graph whose vertices can be ordered so that two vertices are adjacent if and only if they are consecutive in the order. A fourth power path, Pn4, is obtained from Pn by adding edges between any two vertices, u and v, whose distance in Pn, denoted by dPn(u,v), is less than or equal to four. The diameter of a graph G, denoted diam(G) is the greatest distance between any two distinct vertices of G. A radio labeling of a graph G is a function f that assigns to each vertex a label from the set {0,1,2,...} such that |f(u)−f(v)| ≥ diam(G)−d(u,v)+1 hold

APA, Harvard, Vancouver, ISO, and other styles

43

Alshaikh, Rana Ali. "Upset Paths and 2-Majority Tournaments." CSUSB ScholarWorks, 2016. https://scholarworks.lib.csusb.edu/etd/356.

Full text

Abstract:

In 2005, Alon, et al. proved that tournaments arising from majority voting scenarios have minimum dominating sets that are bounded by a constant that depends only on the notion of what is meant by a majority. Moreover, they proved that when a majority means that Candidate A beats Candidate B when Candidate A is ranked above Candidate B by at least two out of three voters, the tournament used to model this voting scenario has a minimum dominating set of size at most three. This result gives 2-majority tournaments some significance among all tournaments and motivates us to investigate when a giv

APA, Harvard, Vancouver, ISO, and other styles

44

Naseath, George Benjamin. "Reducing Curvature in Complex Tool Paths by Deviating from CAM-Produced Tool Paths Within a Tolerance Band." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2245.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Georgakopoulos, Angelos. "Topological paths and cycles in infinite graphs." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=984383743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Seker, Cagil. "Weighted Multi-visibility Analysis On Directional Paths." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12612843/index.pdf.

Full text

Abstract:

Visibility analysis is an important GIS tool that is used in a diverse array of disciplines ranging from earth sciences to telecommunications. Multi-visibility, as a cumulative type of visibility, combines many point-to-point results into a multi-value array. Points, lines, or areas can be used as sources or targets<br>and the combined values can be calculated in both ways. Through multi-visibility, a special 2.5D visibility value surface can be constructed over a digital elevation model. The effectiveness of multi-visibility can be increased with weighted target zones. Other types of weighti

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Dan. "Shortest paths through a reinforced random walk." Thesis, Uppsala universitet, Analys och tillämpad matematik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-153802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Lang, Ian William, and n/a. "Conditional Truths: Remapping Paths To Documentary 'Independence'." Griffith University. Queensland College of Art, 2003. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20031112.105737.

Full text

Abstract:

(Synopsis to introductory statement): An introductory statement to five documentary films made by Ian Lang in Australia between 1981 and 1997 exemplifying a 'democratising' model of sustainable and ethical documentary film production. This document critically reflects on the production process of these films to accompany their submission for the degree of Doctor of Philosophy by Publication at Griffith University. It finds that a contemporary tendency towards 'post-industrial' conditions allows an observational film-maker to negotiate a critical inter-dependence rather than a romantically co

APA, Harvard, Vancouver, ISO, and other styles

49

Magnanti, Thomas L., and Prakash Mirchandani. "Shortest Paths, Network Design and Associated Polyhedra." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5186.

Full text

Abstract:

We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network consisting of a set of arcs on which we can install (load), at a cost, a choice of up to three types of capacitated facilities. Our objective is to determine the configuration of facilities to load on each arc that will satisfy the demand of a single commodity at the lowest possible cost. Our results (i) demonstrate that the single-facility loading problem and certain "comm

APA, Harvard, Vancouver, ISO, and other styles

50

Davis, Sheryl Wiggins. "Career paths of female superintendents in Georgia." Click here to access dissertation, 2007. http://www.georgiasouthern.edu/etd/archive/fall2006/jesse_w_davis/Davis_Jesse_W_200608_edd.pdf.

Full text

Abstract:

Thesis (Ed.D.)--Georgia Southern University, 2007.<br>"A dissertation submitted to the Graduate Faculty of Georgia Southern University in partial fulfillment of the requirements for the degree Doctor of Education." Under the direction of Walter S. Polka. ETD. Electronic version approved: May 2007. Includes bibliographical references (p. 131-152) and appendices.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!