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 20 of 71 for “"spanner"”.
-
Boundary Spanner Modification of Organizational Directives
Boundary spanners represent an important and challenging set of employees for organizational management. Given frequently high autonomy levels and varied job roles, boundary spanning agents have ample opportunity and motivation to modify organizational directives. Based on a multi-theoretical …
-
Boundary Spanner Modification of Organizational Directives
Boundary spanners represent an important and challenging set of employees for organizational management. Given frequently high autonomy levels and varied job roles, boundary spanning agents have ample opportunity and motivation to modify organizational directives. Based on a multi-theoretical …
-
FLOC-SPANNER: An O(1) time, locally self-stabilizing algorithm for geometric spanner construction in a wireless sensor network
Geometric spanners are a popular form of topology control in wireless networks because they yield an efficient, reduced interference subgraph for both unicast and broadcast routing.;In this thesis work a distributed algorithm for creation of geometric spanners in a wireless sensor network is …
-
Community-university engagement in Canada : boundary spanner practice
… of CUE practitioners identified as “boundary spanners.” I took a qualitative research approach to this study, utilizing three sources of data: interviews with boundary spanners across Canada, reflective essays outlining their path to their positions, and key university documents articulating …
-
A spanner in the works : a critique of social psychology.
A critique is made of experimental social psychology in which its claim to give a "deep" understanding of human social behaviour is examined, and found to be groundless. Social psychology's methodological and theoretical assumptions are traced to the work of Kurt Lewin, whose advocacy of a …
-
Fast-sparse-spanner: A practical algorithm for constructing low-stretch sparse geometric graphs
… having a stretch-factor of t is known as a t-spanner. Creating low stretch-factor geometric graphs for large pointsets with a low number of edges is an open problem in computational geometry. In this work, we have designed and engineered a new simple and practical (fast and memory-efficient) …
-
'Spanner in the works' : trade union responses to sickness absence policy management within local government
Through the prism of workplace union representatives (reps), the thesis explores the 'War on the Sickies', the shift towards stricter sickness absence policy (SAP) implementation within local government. By synthesising the literature on sickness absence management, labour process theory, workplace …
-
AN EXPLORATORY ANALYSIS: THE ROLE OF NETWORK STRUCTURES AND BOUNDARY SPANNER BEHAVIORS AS RELATED TO COLLABORATION IN INTER-ORGANIZATIONAL NETWORKS
… latent organizational structures and boundary spanner behaviors that impact perceived levels of inter-organizational collaboration among organizational employees is conducted. The importance of inter-organizational networking and collaboration is illustrated, and gaps in existing knowledge are …
-
Tree Spanners of Simple Graphs
A tree t-spanner T of a simple graph G is a spanning tree of G, such that for every pair of vertices of G their distance in T is at most t times their distance in G, where t is called a stretch factor of T in G. It has been shown that there is a linear time algorithm to find a tree 2-spanner in a …
-
Local Routing in Spanners Based on WSPDs
… an arbitrary edge from each set (called WSPD-spanner) is a 1 + 8/(s − 4)-spanner, where s > 4 is the separation ratio used for partitioning the edges. Although competitive local-routing strategies exist for various spanners such as Yao-graphs, Θ-graphs, and variants of Delaunay graphs, few …
-
Multi-Level Graph Spanners
Given a graph $G$, a \emph{graph spanner} (or simply \emph{spanner}) is a subgraph that preserves lengths of shortest paths in $G$ up to some amount of distortion or error, typically multiplicative and/or additive. Spanners are commonly applied to compress computation on metric spaces corresponding …
-
Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures
… all edges. The idea stems from graph spanner algorithms,which produce sparse subgraphs that guarantee near-optimal paths.Existing asymptotically optimal and near-optimal planners, however,include all sampled configurations as roadmap nodes. Consequently, only infinite graphs have the …
-
Routing on Heavy Path WSPD Spanners
In this thesis, we present a construction of a spanner on a set of $n$ points in $\R^d$ that we call a heavy path WSPD spanner. The construction is parameterized by a constant $s>2$. The size of the graph is $O(s^dn)$ and the spanning ratio is at most $1+2/s+2/(s-1)$. We also show that this graph …
-
On path-greedy geometric spanners
A t-spanner is a graph in which the shortest path between two vertices never exceeds t times the distance between the two nodes – a t-approximation of the complete graph. A geometric graph is one in which its vertices are points with defined coordinates and the edges correspond to line segments …
-
A clustered back-bone for routing in ad-hoc networks
… a connected, planar back-bone which is also a t-spanner of the original Unit Disk Graph (UDG). Some of the previously proposed algorithms require the nodes to construct local variations of the Delaunay Triangulation and undertake several complicated steps for ensuring the planarity of the …
-
The Effects of Hierarchy on Boundary Spanners' Communication
… to explore the communication role of boundary spanners within and between their organizations. The theoretical model in this research focuses on how the organizational hierarchy affects inter-organizational communication and subsequently the function of boundary spanner in supply chain …
-
Geometric Decompositions and Networks - Approximation Bounds and Algorithms
… turn our attention to the problem of finding a t-spanner of a complete geometric graph. The aim is to produce a sparse graph with a small number of edges and with low total weight, that is almost as "good" as a complete graph. With good we mean that for every pair of points in the graph there …
-
Exploring a Boundary-Spanner's Beliefs, Tensions, and Decision-Making as a Methods Course Instructor and University Supervisor: A Self-Study
… I found how my unique role of being a boundary-spanner enabled me to make valuable connections between the clinical context and my methods course. Finally, I found I listened to preservice teachers which influenced my instruction so that I could support their learning. My findings have …
-
Feedback seeking in customer service relationships
… employees delivering the service (i.e., boundary spanners). The purpose of this study was to provide an investigation into service effectiveness (i.e., customer satisfaction and repatronage and word-of-mouth intentions) in service relationships. Specifically, boundary spanners' perceived …
Page 1 of 4