Results 11 to 20 of about 1,115,339 (315)

Convex (α, β)-Generalized Contraction and Its Applications in Matrix Equations

open access: yesAxioms, 2023
This paper investigates the existence and convergence of solutions for linear and nonlinear matrix equations. This study explores the potential of convex (α,β)-generalized contraction mappings in geodesic spaces, ensuring the existence of solutions for ...
Rahul Shukla, Winter Sinkala
doaj   +1 more source

Relaxing Time Windows by Partial Orders in Routing Problems With Stacking Constraints

open access: yesIEEE 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]

open access: yes, 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.
Sénac, Patrick   +4 more
core   +1 more source

Partially Ordered Models [PDF]

open access: yesJournal of Statistical Physics, 2010
54 pages, 11 figures, 6 simulations.
Fernandez, R., Deveaux, V.
openaire   +4 more sources

Parallel evolutionary algorithms for the reconfigurable transfer line balancing problem [PDF]

open access: yesYugoslav Journal of Operations Research
This 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

Betweenness of partial orders [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 2020
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial orders that can be reconstructed from their betweenness relations. We propose a polynomial time algorithm that tests
openaire   +2 more sources

A metrizable semitopological semilattice with non-closed partial order

open access: yesTopological 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 as Decision Support between Statistics and Multicriteria Decision Analyses

open access: yesStandards, 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

Partial Order Infinitary Term Rewriting [PDF]

open access: yesLogical 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

On Finding Two Posets that Cover Given Linear Orders

open access: yesAlgorithms, 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

Home - About - Disclaimer - Privacy