Partial orders and directed acyclic graphs are commonly recurring data structures that arise naturally in numerous domains applications used to represent ordered relations between entities the domains. Examples task dependencies a project plan, transaction order distributed ledgers execution sequences of tasks computer programs, just mention few. We study problem preserving hierarchical cluster...

By representing words with probability densities rather than point vectors, probabilistic word embeddings can capture rich and interpretable semantic information and uncertainty (Vilnis & McCallum, 2014; Athiwaratkun & Wilson, 2017). The uncertainty information can be particularly meaningful in capturing entailment relationships – whereby general words such as “entity” correspond to broad distr...

In this paper the notion of a partial-order plan is extended to task-hierarchies. We introduce the concept of a partial-order taskhierarchy that decomposes a problem using multi-tasking actions. We go further and show how a problem can be automatically decomposed into a partial-order task-hierarchy, and solved using hierarchical reinforcement learning. The problem structure determines the reduc...

This paper describes a new planner, HiPOP (Hierarchical Partial-Order Planner), which is domain-configurable and uses POP techniques to create hierarchical time-flexible plans. HiPOP takes as inputs a description of a domain, a problem, and some optional userdefined search-control knowledge. This additional knowledge takes the form of a set of abstract actions with optional methods to achieve t...

abstract purpose of this paper: the objectives of this paper are two folds: (1) utilizing hierarchical fuzzy technique for order preference by similarity to ideal solution (topsis) approach to evaluate the most suitable rfid-based systems decision, and (2) to highlight key risks and benefits of radio frequency identification technology in healthcare industry. design/methodology/approach: resear...

An attempt is made to create some statistical tests for comparing results of hierarchical cluster analysis based on the uniform distribution over the set of all possible dendrograms. Three different uniform distributions are considered according to the degree of similarity of the dendrograms. Some distances between dendrograms are defined and The solutions proposed are computational and are bas...