Results 21 to 30 of about 4,764,395 (287)
When a partial Borel order is linearizable [PDF]
, 1997 We prove the following classification theorem of the ``Glimm -- Effros'' type for Borel order relations: a Borel partial order on the reals either is Borel linearizable or includes a copy of a certain Borel partial order $\meo$ which is not Borel ...
Kanovei, Vladimir
core +1 more source
Relaxing Time Windows by Partial Orders in Routing Problems With Stacking Constraints
IEEE Access, 2019 In vehicle routing problems, time windows are often used to formulate partial order relations between tasks in optimization model and related algorithm. However, time-window and partial order constraints are not equivalent.
Chen Wei, Zhi-Hua Hu, Wen-Wen Gao
doaj +1 more source
Transport of video over partial order connections [PDF]
, 1999 A Partial Order and partial reliable Connection (POC) is an end-to-end transport connection authorized to deliver objects in an order that can differ from the transmitted one. Such a connection is also authorized to lose some objects.
Amer +14 more
core +2 more sources
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
POPE: Partial Order Preserving Encoding [PDF]
, 2016 Recently there has been much interest in performing search queries over encrypted data to enable functionality while protecting sensitive data. One particularly efficient mechanism for executing such queries is order-preserving encryption/encoding (OPE ...
Apon, Daniel +3 more
core +2 more sources
Partial Order as Decision Support between Statistics and Multicriteria Decision Analyses
Standards, 2022 Evaluation by ranking/rating of data based on a multitude of indicators typically calls for multi-criteria decision analyses (MCDA) methods. MCDA methods often, in addition to indicator values, require further information, typically subjective.
Lars Carlsen, Rainer Bruggemann
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
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
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
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