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 14977 for “"interval"”.
-
Interval Digraphs
We say that a simple, undirected graph interval graph if there exists a function mapping the vertices of the graph to intervals such that each pair of vertices is adjacent if and only if the corresponding intervals have a non-empty intersection. Undirected interval graphs were originally of …
-
Interval order enumeration
This thesis continues the study of interval orders and related structures, containing results on both the labeled and unlabeled variants. Following a result of Eriksen and Sjo?strand (2014) we identify a link between structures following the Fishburn distribution and Mahonian structures. This is …
-
Random Interval Graphs
… by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform distribution on $[0,1]$. We then say that the $i$th of the $n$ vertices is the interval …
-
Ordered Interval Routing Schemes
An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most <i>k</i> intervals per edge …
-
Online t-interval scheduling
This paper deals with non-preemptive online t-interval scheduling. A tinterval is a union of t half-open intervals (segments). In online scheduling the t-intervals are presented incrementally and each presented interval must be accepted or lost forever. A presented t-interval which overlaps a …
-
Development of interval and non-interval methods for solving multi-objective optimization problems
… a set of constraints (Awad and Khanna 2015). The interval method (as a non-scalarization MOP method) is known as a precise and robust tool for optimization that guarantees to capture all points on the Pareto-front (Kubica and Woźniak 2007) . This research investigated the interval and non-interval …
-
An investigation into choice between fixed-interval and mixed-interval schedules of reinforcement
… One of the two terminal links was always a fixed-interval schedule of 10 sec duration. The other terminal link was either a two-valued mixed-interval schedule or a fixed-interval schedule. The shorter of the two intervals comprising the mixed-interval schedules was always 5 sec, the longer was …
-
Corrected Interval Multiscale Analysis (CIMSA) for the Decomposition and Reconstruction of Interval Data
… In this paper, the extension of MSA for interval data is studied. Unlike single-valued data, interval data use bounds to denote the uncertainties within data points. Data aggregation can be used to convert a set of single-valued data into a smaller set of interval data. The literature on …
-
Thin-Bed Interval Velocity Inversion
… inferred using spectral decomposition. Thus, the interval velocity of the layer can be determined from its moveout curve, even when top and base reflectors cannot be resolved. This extends the range of layer thicknesses over which interval velocities can be measured using moveout from above to …
-
Sum Integrals of Interval Functions
No abstract prepared.
-
Interval methods for global optimization
We propose interval arithmetic and interval constraint algorithms for global optimization. Both of these compute lower and upper bounds of a function over a box, and return a lower and an upper bound for the global minimum. In interval arithmetic methods, the bounds are computed using interval …
-
Global optimization using interval constraints
… the first to propose the bounding method using interval arithmetic for unconstrained global optimization. The first bounding method using interval arithmetic for constrained global optimization was due to E. R. Hansen and S. Sengupta. These methods are the well known bounding methods. Since …
-
Multi-dimensional Interval Routing Schemes
… tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy for routing messages in a network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The …
-
Interval Edge-Colorings of Graphs
… of a graph G by positive integers is called an interval edge-coloring if the colors assigned to the edges incident to any vertex in G are consecutive (i.e., those colors form an interval of integers). The notion of interval edge-colorings was first introduced by Asratian and Kamalian in 1987, …
-
Investigations on Multiple Interval Estimators
Multiple interval estimation for a set of parameters is investigated. To begin, a strategy of optimization for a multiple interval estimator (MIE) is introduced. This approach allocates distinct optimized levels to individual interval estimators so that the global expected content can be minimized …
-
An Interval-Valued Random Forests
… the data. Representing the data in terms of intervals can help address this uncertainty by reducing the data size or accommodating imprecision. Traditional methods have already embraced this concept, but given the rising popularity of machine learning, it is essential to develop models for …
Page 1 of 749