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 54 for “"partial order"”.
-
Partial Order Reduction for Planning
Partial Order Reduction: POR) is a technique that reduces the search space by recognizing interchangeable orders between actions and expanding only a subset of all possible orders during the search. It has been extensively studied in model checking and has proven to be an enabling technique for …
-
A partial order approach to decentralized control
… of linear systems. We employ the theory of partially ordered sets (posets) to model and analyze a class of decentralized control problems. Posets have attractive combinatorial and algebraic properties; the combinatorial structure enables us to model a rich class of communication structures …
-
Minimaximal and maximinimal optimisation problems : a partial order-based approach
… optimisation problems, based on a particular partial order concept. To accompany this framework, we define a variety of partial orders, an important example being the partial order of set inclusion. By considering various source optimisation problems from the literature, and partial orders …
-
A state-oriented, partial-order model and logic for distributed systems verification
A theory of state-oriented, partially-ordered model named, Communicating Minimal prefix machines (CMpms) that represent a fixed set of processes, is presented. Each of these Mpms is a possibly infinite, State Transition System . Communication among a set of Mpms is by synchronization. Enriched by a …
-
Ramsey theory and its application
… a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. Third, we study the relations between Ramsey theorems which have points in common with the classical Ramsey theorem and the dual Ramsey theorem by the concept of …
-
Bounded Aggregation Techniques to Solve Large Markov Models
… accuracy, Markovian models that are more than an order of magnitude more complex than models solvable by current techniques, and that the aggregation techniques can be automated in many cases. We prove that claim by extending existing aggregation techniques to develop a new partial order that we …
-
Techniques for formal verification of concurrent and distributed program traces
… systems. By allowing an observer to analyze a partial order trace rather than a total order trace, we get the benefit of properly dealing with concurrent events and especially of detecting errors from analyzing successful executions, errors which can occur under a different thread scheduling. …
-
Symmetric spaces
… minimizing geodesic. Analogous to define a partial order on a vector space, we construct the partial order on the gyrovector space and investigate its properties related with what we call the gyrolines and the cogyrolines. Finally we apply the concept of gyrogroup structure to the setting of …
-
Characterizing topologies by classes of functions and multifunctions
… shown to determine the topology of T₁ spaces. A partial order for classes of topologies for the real numbers is defined and relationships between various classes are established"--Abstract, page ii.
-
Active caching for recommender systems
… cached, where the estimation makes use of the partial order lists cached for related queries. By answering non-cached queries along with cached queries, the active caching system acts as a form of query processor and offers substantial improvement over traditional caching methodologies. Test …
-
Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs
… problem on 2-dimensional 2-colorable (2D2C) partial order. We show that the jump number of a 2D2C poset is equivalent to the maximum cardinality of an independent set in a properly defined collection of rectangles in the plane. We then model the geometric problem as a linear program. Even …
-
Topics in combinatorics and combinatorial algorithms
… topics. The first is a structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The interval number is related to a well-studied poset parameter, partial order dimension. We derive an upper bound on the …
-
Free resolutions, combinatorics, and geometry
… cone has a triangulation induced from a certain partial order. Our first result gives a module-theoretic interpretation of this poset structure. The study of the cone of cohomology tables over an arbitrary polarized projective variety is closely related to the existence of an Ulrich sheaf, and …
-
Studies on memory consistency and synchronization : failure detection in parallel programs
… memory operations sequentially in program order, leading to poor performance. We propose Link Consistency which still preserves Sequential Consistency for parallel programs that contain no data race or synchronization failure while permitting out of (program) order execution of operations. …
-
Methods for Solving Generalized Systems of Inequalities With Application to Nonlinear Programming
… relation "(LESSTHEQ)(,K)" represents the usual partial order induced on Y by K. A wide variety of problems in optimization theory can be cast in this framework, e.g. solving systems of equations and inequalities, solving general nonlinear complementarity problems, and finding Karush-Kuhn-Tucker …
-
Combinatorial channels from partially ordered sets
… classical and modern, using the framework of partially ordered sets. We represent adversarial error models as combinatorial channels, form combinatorial channels from posets, identify a structural property of posets that leads to families of channels with the same codes, and bound the size of …
-
Systematic testing for actor programs
… and the key source of non-determinism is the order in which messages are delivered to and processed by the actors. As a result, errors may occur in actor programs due to the incorrect interleaving of messages, conflicting constraints on what messages can be delivered, or errors in the …
-
The Quicksort algorithm and related topics
… is dedicated to the analysis of finding the true order by further pairwise comparisons when a partial order compatible with the true order is given in advance. We discuss a number of cases where the partially ordered sets arise at random. To this end, we employ results from Graph and Information …
-
Two Problems in Computational Genomics
… inferring horizontal gene transfer, we define partial order sets among species, with respect to different genes, and infer genes involved in horizontal gene transfer by comparing posets for different genes. The posets are used to construct a tree for each gene. Those trees are then compared and …
-
Minors and planar embeddings of digraphs
… on digraphs, and measures which refine the partial ordering. Tournaments are digraphs with exactly one edge between every distinct pair of vertices. The domination graph of a tournament is a graph with the same vertices, and an edge between two of the vertices if every other vertex is beaten …
Page 1 of 3