Results 1 to 10 of about 983,049 (165)
On the heapability of finite partial orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
János Balogh +4 more
doaj +3 more sources
The isomorphism relation between tree-automatic Structures [PDF]
Open Mathematics, 2010 An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures.
Finkel Olivier, Todorčević Stevo
doaj +5 more sources
Partial Codes Risk Whole Confusion: Characteristics and Outcomes of Pediatric Partial Code Orders [PDF]
ChildrenObjective—Partial do-not-resuscitate (DNR) orders, directives specifying limited resuscitative efforts, are intended to align medical interventions with patient preferences.
Rachel Jalfon +9 more
doaj +2 more sources
Tree-Automatic Well-Founded Trees [PDF]
Logical Methods in Computer Science, 2013 We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega.
Martin Huschenbett +3 more
doaj +8 more sources
Implementing the time-to-event continual reassessment method in the presence of partial orders in a phase I head and neck cancer trial [PDF]
BMC Medical Research MethodologyBackground In this article we describe the methodology of the time-to-event continual reassessment method in the presence of partial orders (PO-TITE-CRM) and the process of implementing this trial design into a phase I trial in head and neck cancer ...
Amit Patel +7 more
doaj +2 more sources
Games, 2021 We introduce a non-cooperative game model in which players’ decision nodes are partially ordered by a dependence relation, which directly captures informational dependencies in the game. In saying that a decision node v is dependent on decision nodes v1,…,vk, we mean that the information available to a strategy making a choice at v is precisely the ...
Valeria Zahoransky +3 more
openaire +4 more sources
Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular Grid
Mathematics, 2022 In (digital) grids, neighbor relation is a crucial concept; digital distances are based on paths through neighbor points. Digital distances are significant, e.g., in digital image processing for giving an approximation of the Euclidean distance and ...
Benedek Nagy
doaj +1 more source
On contraction coefficients, partial orders and approximation of capacities for quantum channels [PDF]
Quantum, 2022 The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of many results in
Christoph Hirche +2 more
doaj +1 more source
The Upper and Lower Solution Method for a Class of Interval Boundary Value Problems
Axioms, 2021 In this paper, the upper and lower solution method is proposed in order to solve the second order interval boundary value problem. We study first a class of linear interval boundary value problems and then investigate a class of nonlinear interval ...
Yanzong Yan, Zhiyong Xiao, Zengtai Gong
doaj +1 more source
Reliability Properties of the NDL Family of Discrete Distributions with Its Inference
Mathematics, 2021 The natural discrete Lindley (NDL) distribution is an intuitive idea that uses discrete analogs to well-known continuous distributions rather than using any of the published discretization techniques. The NDL is a flexible extension of both the geometric
Mohammed Mohammed Ahmed Almazah +3 more
doaj +1 more source