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 195 for “"partial order"”.

  1. 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 …

    wustl Repository record for Partial Order Reduction for Planning (opens in a new tab)

  2. Using Reinforcement Learning in Partial Order Plan Space

    Partial order planning is an important approach that solves planning problems without completely specifying the orderings between the actions in the plan. This property provides greater flexibility in executing plans; hence making the partial order planners a preferred choice over other planning …

    unt Repository record for Using Reinforcement Learning in Partial Order Plan Space (opens in a new tab)

  3. Understanding the wait-free set-consensus partial order

    … a complete characterization of the Set Consensus Partial Order, a refinement of the Consensus Hierarchy of Herlihy. We define the (n, k )-set consensus problem as the k-set consensus problem for n processors. We then answer the question of whether an (n, k)-set consensus object (an object which …

    iastate Repository record for Understanding the wait-free set-consensus partial order (opens in a new tab)

  4. Efficient Pattern Search in Large, Partial-Order Data Sets

    The behaviour of a large, distributed system is inherently complex. One step towards making this behaviour more understandable to a user involves instrumenting the system and collecting data about its execution. We can model the data as traces (representing various sequential entities in the system …

    waterloo Repository record for Efficient Pattern Search in Large, Partial-Order Data Sets (opens in a new tab)

  5. Analysis of partial order reduction techniques for automated planning

    … search needs the aid of orthogonal techniques. Partial order reduction is a well-known and reliable approach that has originally been introduced in the area of computer aided verification to tackle the state explosion problem. It is usually used for explicit state-space search to reduce the size …

    freiburg-diss Repository record for Analysis of partial order reduction techniques for automated planning (opens in a new tab)

  6. A Scalable Partial-Order Data Structure for Distributed-System Observation

    Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can observe by three fundamental problems. They lack scalable information collection, …

    waterloo Repository record for A Scalable Partial-Order Data Structure for Distributed-System Observation (opens in a new tab)

  7. 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 …

    glasgow Download PDF for Minimaximal and maximinimal optimisation problems : a partial order-based approach (opens in a new tab)

  8. A Partial Order Structure on the Shellings of Lexicographically Shellable Posets.

    … the notion of lexicographic shellability of partially ordered sets (posets). Lexicographic shelling of posets was introduced by Bj{\"o}rner via a type of poset labeling known as an EL-labeling and was generalized by Bj{\"o}rner and Wachs to the notion of CL-labeling. We introduce and study a …

    oregon Repository record for A Partial Order Structure on the Shellings of Lexicographically Shellable Posets. (opens in a new tab)

  9. 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 …

    concordia Download PDF for A state-oriented, partial-order model and logic for distributed systems verification (opens in a new tab)

  10. Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems

    … algorithm for finding event-patterns in large partial-order datasets. In this thesis, we improve on this work by parallelizing the search algorithm. This is useful as many computers these days have more than one core or processor. Therefore, it makes sense to exploit this available computing …

    waterloo Repository record for Parallel Pattern Search in Large, Partial-Order Data Sets on Multi-core Systems (opens in a new tab)

  11. Combining symbolic and partial order methods for model checking 1-safe Petri nets

    … checking techniques are used, combined with two partial order semantics known as net unfoldings and processes. We start with net unfoldings and study deadlock and reachability checking problems, using complete finite prefixes of net unfoldings introduced by McMillan. It is shown how these …

    aalto Repository record for Combining symbolic and partial order methods for model checking 1-safe Petri nets (opens in a new tab)

  12. An Efficient Partial-Order Characterization of Admissible Actions for Real-Time Scheduling of Sporadic Tasks

    … may not be completely known a priori but only partially. For example, in some applications only the cost of the current allocation of resources to the tasks could be available. Under this scenario, a sensible approach is to optimally allocate resources without compromising the schedulability of …

    ut-knoxville Repository record for An Efficient Partial-Order Characterization of Admissible Actions for Real-Time Scheduling of Sporadic Tasks (opens in a new tab)

  13. Rigidity properties of operator systems and partial order relations in the state space of C*-algebras

    … system. The maximal states in the dilation order fully encapsulate the cyclic representations of a C*-algebra with the unique extension property. A reformulation of the conjecture by Davidson and Kennedy raises the question whether the maximal measures in the dilation order are concentrated …

    manitoba Repository record for Rigidity properties of operator systems and partial order relations in the state space of C*-algebras (opens in a new tab)

Page 1 of 10