Results 291 to 300 of about 11,624,387 (363)
Combinatorial results for order-preserving partial injective contraction mappings
A Musa +4 more
openalex +2 more sources
Self-Consistent Field Analysis of Segregative Aqueous Dextran-Polyethylene Glycol Solutions: (2) Adsorption and Wetting. [PDF]
J Phys Chem BLeermakers FAM +3 more
europepmc +1 more source
Understanding oxygen transfer on ceria with Pt single atoms for surface reaction. [PDF]
Nat CommunChoi Y +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Handbook of Model Checking, 2000
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked.
D. Peled
openaire +2 more sources
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked.
D. Peled
openaire +2 more sources
Some new results on the core partial order
Linear and multilinear algebra, 2020The current research investigates the core partial order for its further properties. We introduce a new property for matrices of index at most 1, namely and is called as ‘the core-subtractivity’.
David Eduardo Ferreyra, S. Malik
semanticscholar +1 more source
Mathematical Logic Quarterly, 1992
AbstractWe show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
Sandu, Gabriel, Väänänen, Jouko
openaire +1 more source
AbstractWe show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
Sandu, Gabriel, Väänänen, Jouko
openaire +1 more source
Canadian Journal of Mathematics, 1968
Let n be an ordinal. A partial ordering P of the ordinals T = T(n) = {w: w < n} is called natural if x P y implies x ⩽ y.A natural partial ordering, hereafter abbreviated NPO, of T(n) is thus a coarsening of the natural total ordering of the ordinals. Every partial ordering of a finite set 5 is isomorphic to a natural partial ordering.
Dean, R. A., Keller, G.
openaire +2 more sources
Let n be an ordinal. A partial ordering P of the ordinals T = T(n) = {w: w < n} is called natural if x P y implies x ⩽ y.A natural partial ordering, hereafter abbreviated NPO, of T(n) is thus a coarsening of the natural total ordering of the ordinals. Every partial ordering of a finite set 5 is isomorphic to a natural partial ordering.
Dean, R. A., Keller, G.
openaire +2 more sources
ACM Transactions on Database Systems, 2023
Partial order multiway search(POMS) is a fundamental problem that finds applications in crowdsourcing, distributed file systems, software testing, and more. This problem involves an interaction between an algorithm 𝒜 and an oracle, conducted on a directed acyclic graph 𝒢 known to both parties.
Lu Shangqi +3 more
openaire +1 more source
Partial order multiway search(POMS) is a fundamental problem that finds applications in crowdsourcing, distributed file systems, software testing, and more. This problem involves an interaction between an algorithm 𝒜 and an oracle, conducted on a directed acyclic graph 𝒢 known to both parties.
Lu Shangqi +3 more
openaire +1 more source