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 8 of 8 for “"Blocking sets"”.
-
Network Bargaining: Creating Stability Using Blocking Sets
… bargaining solutions. We define the concept of Blocking Sets, introduced by Biro, Kern and Paulusma, and use them to create stability. We show that by removing a blocking set from an unstable network, we can find a balanced bargaining division in polynomial time. This motivates the search for …
-
t-blocking sets and semiovals in Witt designs
… of this thesis is to characterize all 't'-blocking sets (see definition 3.1) and all semiovals (see definition 4.2) in the Witt designs up to the frequency vectors. In chapter 2 we obtain some results which correct some mistakes in [7, 8]. We also improve the results in [9]. In chapter 3 we …
-
Integer Programming Techniques for Propagation and Rainbow Connection Problems in Graphs
… problems are defined using problem specific blocking sets. These blocking sets are introduced, their structural properties are investigated, and computational methods for identifying them are proposed, providing a general recipe for developing integer programming approaches for graph …
-
Connection blocking in lattice quotients of connected lie groups
Finite blocking is an interesting concept originating as a problem in billiard dynamics and later in the context of Riemannian manifolds. Let $(M,g)$ be a complete connected, infinitely differentiable Riemannian manifold. To \textit{block} a pair of points $m_1,m_2 \in M$ is to find a …
-
The empirical power and robustness of multiple comparisons based on rank estimates
It is the goal of this paper to investigate the effectiveness of multiple comparison procedures based on rank estimates rather than least squares estimates.
-
Random allocations: new and extended models and techniques with applications and numerics.
… including varieties, batch arrivals, taboo sets and blocking sets. Static, waiting-time and dynamic processes are investigated. Both without-replacement and with-replacement sampling types are considered. Emphasis is placed on the distributions of waiting-times for one or more events to …
-
Practical Dynamic Transactional Data Structures
… programming that can be avoided by using non-blocking techniques. Non-blocking data structures allow scalable and thread-safe access to shared data by guaranteeing, at least, system-wide progress. In this work, we present the first wait-free hash map which allows a large number of threads to …
-
Hedonic Coalition Formation for Task Allocation with Heterogeneous Robots
Tasks in the real world are complex in nature and often require multiple robots to collaborate in order to be accomplished. However, multiple robots with the same set of sensors working together might not be the optimal solution. In many cases a task might require different sensory inputs and …