Results 21 to 30 of about 11,624,387 (363)
Parallel evolutionary algorithms for the reconfigurable transfer line balancing problem [PDF]
Yugoslav Journal of Operations ResearchThis paper deals with an industrial problem of machining line design, which consists in partitioning a given set of operations into several subsets corresponding to workstations and sequencing the operations to satisfy the technical requirements and ...
Borisovsky Pavel
doaj +1 more source
A metrizable semitopological semilattice with non-closed partial order
Topological Algebra and its Applications, 2020 We construct a metrizable semitopological semilattice X whose partial order P = {(x, y) ∈ X × X : xy = x} is a non-closed dense subset of X × X. As a by-product we find necessary and sufficient conditions for the existence of a (metrizable) Hausdorff ...
Banakh Taras +2 more
doaj +1 more source
An interesting approach to the existence of coupled fixed point
AIMS Mathematics, 2021 Configure a coupled fixed point result on a nonempty set engaging a partial order and induced with a quasi-metric in the sense of Kunzi [12] in the framework of $\mathcal{G}$-metric spaces. Our result is supported by an illustrative example.
Pulak Konar +3 more
doaj +1 more source
The Annals of Probability, 1978 A probability measure $P$ on a partially ordered Polish space $E$ is called stochastically smaller than $Q$ (notation: $P \leqslant Q$) if $\int f dP \leqslant \int f dQ$ holds for all bounded increasing measurable $f$. We investigate the question when for a stochastically increasing family $\{P_t, t \in \mathbb{R}\}$ there exists an increasing process
Kamae, T., Krengel, U.
openaire +3 more sources
Bringing Order to Chaos - A Compact Representation of Partial Order in SAT-Based HTN Planning
AAAI Conference on Artificial Intelligence, 2019 HTN planning provides an expressive formalism to model complex application domains. It has been widely used in realworld applications. However, the development of domainindependent planning techniques for such models is still lacking behind.
G. Behnke +2 more
semanticscholar +1 more source
On Finding Two Posets that Cover Given Linear Orders
Algorithms, 2019 The Poset Cover Problem is an optimization problem where the goal is to determine a minimum set of posets that covers a given set of linear orders. This problem is relevant in the field of data mining, specifically in determining directed networks or ...
Ivy Ordanel +2 more
doaj +1 more source
Lexicographic Partial Order [PDF]
Transactions of the American Mathematical Society, 1978 Given a (partially) ordered set P with the descending chain condition, and an ordered set Q, the set Q P {Q^P} of functions from P to Q has a natural lexicographic order, given by f ⩽ g f \leqslant g if and only if f ( y )
openaire +1 more source
Hypernym Detection Using Strict Partial Order Networks
AAAI Conference on Artificial Intelligence, 2019 This paper introduces Strict Partial Order Networks (SPON), a novel neural network architecture designed to enforce asymmetry and transitive properties as soft constraints. We apply it to induce hypernymy relations by training with is-a pairs.
Sarthak Dash +4 more
semanticscholar +1 more source
Aggregating Partially Ordered Preferences [PDF]
Journal of Logic and Computation, 2008 Preferences are not always expressible via complete inear orders: sometimes it is more natural to allow for the presence of incomparable outcomes. This may hold both in the agents' preference ordering and in the social order. In this article, we consider this scenario and study what properties it may have. In particular, we show that, despite the added
PINI, MARIA SILVIA +3 more
openaire +2 more sources
Partial Order Infinitary Term Rewriting [PDF]
Logical Methods in Computer Science, 2014 We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions.
Patrick Bahr
doaj +1 more source