Results 21 to 30 of about 950 (196)
, 2013 Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity $O(n^{3}m)$, compares favourably with ...
Manish Gaur, S. Arun-Kumar
openaire +1 more source
Preorders in Simple Games [PDF]
, 2017 Any power index defines a total preorder in a simple game and, thus, induces a hierarchy among its players. The desirability relation, which is also a preorder, induces the same hierarchy as the Banzhaf and the Shapley indices on linear games, i.e., games in which the desirability relation is total.
Freixas Bosch, Josep +1 more
openaire +3 more sources
Annals of Pure and Applied Logic, 2013 60 pages, updated ...
Kosta Dosen, Zoran Petric
openaire +3 more sources
Interference-Sensitive Preorders for MANETs [PDF]
2012 Ninth International Conference on Quantitative Evaluation of Systems, 2012 Connectivity and communication interference are two key aspects in mobile ad-hoc networks (MANETs). We propose a process algebraic model targeted at the analysis of both such aspects of MANETs. The framework includes a probabilistic process calculus and a suite of analytical techniques based on a probabilistic observational congruence and an ...
BUGLIESI, Michele +4 more
openaire +3 more sources
Equivalent Solutions of Nonlinear Equations in a Topological Vector Space with a Wedge
Journal of Inequalities and Applications, 2007 We obtain efficient conditions under which some or all solutions of a nonlinear equation in a topological vector space preordered by a closed wedge are comparable with respect to the corresponding preordering.
Rontó A, Šremr J
doaj +2 more sources
Preordered forests, packed words and contraction algebras
, 2013 42 pagesWe introduce the notions of preordered and heap-preordered forests, generalizing the construction of ordered and heap-ordered forests. We prove that the algebras of preordered and heap-preordered forests are Hopf for the cut coproduct, and we ...
Mansuy, Anthony
core +3 more sources
Toward a theory of monomial preorders [PDF]
Mathematics of Computation, 2017 In this paper we develop a theory of monomial preorders, which differ from the classical notion of monomial orders in that they allow ties between monomials. Since for monomial preorders, the leading ideal is less degenerate than for monomial orders, our results can be used to study problems where monomial orders fail to give a solution.
Gregor Kemper +2 more
openaire +3 more sources
Lifting Theorems for Continuous Order-Preserving Functions and Continuous Multi-Utility
Axioms, 2023 We present some lifting theorems for continuous order-preserving functions on locally and σ-compact Hausdorff preordered topological spaces. In particular, we show that a preorder on a locally and σ-compact Hausdorff topological space has a continuous ...
Gianni Bosi, Magalì Zuanon
doaj +1 more source
Splaying Preorders and Postorders [PDF]
, 2019 Let $T$ be a binary search tree. We prove two results about the behavior of the Splay algorithm (Sleator and Tarjan 1985). Our first result is that inserting keys into an empty binary search tree via splaying in the order of either $T$'s preorder or $T$'s postorder takes linear time.
Caleb C. Levy, Robert E. Tarjan
openaire +3 more sources
Preordering Encoding on Transformer for Translation [PDF]
IEEE/ACM Transactions on Audio, Speech, and Language Processing, 2021 The difference in word orders between source and target languages is a serious hurdle for machine translation. Preordering methods, which reorder the words in a source sentence before translation to obtain a similar word ordering with a target language, significantly improve the quality in statistical machine translation.
Yuki Kawara, Chenhui Chu, Yuki Arase
openaire +2 more sources