Results 281 to 290 of about 69,240 (308)

Canonizable Partial Order Generators

2012
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we focused on the study of Hasse diagram generators, i.e., slice graphs that generate only transitive reduced DAGs.
openaire   +2 more sources

Fuzzy matrix partial orderings and generalized inverses

Fuzzy Sets and Systems, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the Generation of Extensions of a Partially Ordered Set

2003
A partially ordered set (or simply order) P is a set of elements E, together with a set R of relations of E, satisfying reflexivity, anti-symmetry and transitivity. The set E is called the ground set of P, while R is the relation set of it. There are many special orders.
openaire   +1 more source

Generalized partial orders for polar code bit-channels

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017
We study partial orders (POs) for the synthesized bit-channels of polar codes. First, we consider complementary bit-channel pairs whose Bhattacharyya parameters over the binary erasure channel (BEC) exhibit a symmetry property and provide insight into the alignment of polarized sets of bit-channels for the BEC and general binary-input memo-ryless ...
Wei Wu 0028, Bing Fan, Paul H. Siegel
openaire   +1 more source

An algorithm to generate the ideals of a partial order

Operations Research Letters, 1986
Generating the ideals of a partially ordered set is an important, frequently occurring problem in scheduling, reliability, sensitivity analysis for network flows and other combinatorial optimization problems. In this paper we present an algorithm which generates all the ideals of a partial order on n elements in O(n) time per ideal.
openaire   +1 more source

Transformations on General Partial Orders

2013
Next we will be considering repetitions of items in the input sequential data, and as a consequence, the final closed partial orders are not necessarily injective. As we will see, dealing with general partial orders makes the proper formalization with category theory a bit more difficult.
openaire   +1 more source

Generalized intervals in partially ordered groups

Mathematical Proceedings of the Cambridge Philosophical Society, 1959
1. Introduction. The present paper is chiefly concerned with a generalization, to be known as a ‘D-interval’, of the notion of interval or segment in an arbitrary partially ordered group. This idea is originally due to Duthie (2), but was developed by him only in a lattice.
openaire   +2 more sources

Generalized cyclic contractions in partially ordered metric spaces

Optimization Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali Abkar, Moosa Gabeleh
openaire   +2 more sources

On methods for generating random partial orders

Operations Research Letters, 1986
Three parametric methods for generating random partial orders on a fixed set are presented. Simulation is used to examine the relationship between the method parameters and the densities of the partial orders that are generated by the methods. Regression analysis is used to develop equations to estimate the parameters that should be used to obtain ...
openaire   +1 more source

Generalized o-minimality for partial orders

Siberian Advances in Mathematics, 2013
Summary: We consider partially ordered models. We introduce the notions of a weakly (quasi-) p.o.-minimal model and a weakly (quasi-) p.o.-minimal theory. We prove that weakly quasi-p.o.-minimal theories of finite width lack the independence property, weakly p.o.-minimal directed groups are abelian and divisible, weakly quasi-p.o.-minimal directed ...
openaire   +2 more sources