Results 301 to 310 of about 11,624,387 (363)
Some of the next articles are maybe not open access.
Top-k Sorting Under Partial Order Information
SIGMOD Conference, 2018We address the problem of sorting the top-k elements of a set, given a predefined partial order over the set elements. Our means to obtain missing order information is via a comparison operator that interacts with a crowd of domain experts to determine ...
Eyal Dushkin, Tova Milo
semanticscholar +1 more source
ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems, 2017
openaire +2 more sources
openaire +2 more sources
1999
Many of the semirings originally studied, such as ℕ and ideal(R), have a partial-order structure in addition to their algebraic structure and, indeed, the most interesting theorems concerning them make use of the interplay between these two structures.
openaire +1 more source
Many of the semirings originally studied, such as ℕ and ideal(R), have a partial-order structure in addition to their algebraic structure and, indeed, the most interesting theorems concerning them make use of the interplay between these two structures.
openaire +1 more source
Partial Orderings in Chemistry
Journal of Chemical Information and Computer Sciences, 1997The cosmopolitan relevance of partially ordered mathematical structures in chemistry is argued. Many examples are briefly noted, including those involving chemical periodicities, reactivities, aromaticities, electronegativities, molecular branching, molecular shapes, symmetries, complexities, curve fittings, and more.
Klein, D.J, Babić, Darko
openaire +3 more sources
Unfolding-based Partial Order Reduction
International Conference on Concurrency Theory, 2015Partial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of both approaches in an effort to combine their strengths. We first define, for
César Rodríguez +3 more
semanticscholar +1 more source
Partial Order Reduction for Security Protocols
International Conference on Concurrency Theory, 2015Security protocols are concurrent processes that communicate using cryptography with the aim of achieving various security properties. Recent work on their formal verification has brought procedures and tools for deciding trace equivalence properties (e ...
David Baelde, S. Delaune, L. Hirschi
semanticscholar +1 more source
Uncountable Homogeneous Partial Orders
MLQ, 2002A partially ordered set is called \(k\)-homogeneous if any isomorphism between \(k\)-element subsets extends to an automorphism. In this paper the \(k\)-homogeneous but not \((k+1)\)-homogeneous partially ordered sets are studied.
Droste, Manfred +2 more
openaire +2 more sources
Partially Ordered Abelian Groupoids
Siberian Mathematical JournalzbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. A. Pervukhin +2 more
openaire +2 more sources
1997
Abstract We explore several connections between graphs and partially ordered sets. We define various graphs and digraphs associated with a partially ordered set, and explore how the properties of the partial order are reflected in these graphs.
openaire +1 more source
Abstract We explore several connections between graphs and partially ordered sets. We define various graphs and digraphs associated with a partially ordered set, and explore how the properties of the partial order are reflected in these graphs.
openaire +1 more source
Correlation Among Partial Orders
SIAM Journal on Algebraic Discrete Methods, 1983If A is a poset and P is a (finite) poset whose underlying set contains the elements of A, then A is said to occur in a linear extension L of P if each relation in A is realized in L; if L is chose...
openaire +2 more sources