Results 271 to 280 of about 1,017,520 (318)
Some of the next articles are maybe not open access.

Generalized contractions in partially ordered metric spaces

Applicable Analysis, 2008
We present some fixed point results for monotone operators in a metric space endowed with a partial order using a weak generalized contraction-type assumption.
Ravi P. Agarwal   +2 more
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

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

Weak cosmic censorship conjecture in gedanken experiments at all orders

Physical Review D
We present a systematic analysis of the Weak Cosmic Censorship Conjecture (WCCC) through Gedankenexperiments involving black hole perturbations induced by test particles. Our approach allows for the calculation of perturbations to any order for a general
Kai-Peng Lu, Peng-Yu Wu, H. Lü
semanticscholar   +1 more source

The Partial Search Order Problem

Electronic Journal of Combinatorics
In recent years, questions about the construction of special orderings of a given graph search were studied by several authors. On the one hand, the so called end-vertex problem introduced by Corneil et al.
Robert Scheffler
semanticscholar   +1 more source

Vibrocorrect First-Order Partial Differential Equations with Generalized Inputs

Differential Equations, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gasanov, K. K., Guseinova, Kh. T.
openaire   +1 more source

Fast and Simple Sorting Using Partial Information

ACM-SIAM Symposium on Discrete Algorithms
We consider the problem of sorting $n$ items, given the outcomes of $m$ pre-existing comparisons. We present a simple and natural deterministic algorithm that runs in $O(m+\log T)$ time and does $O(\log T)$ comparisons, where $T$ is the number of total ...
Bernhard Haeupler   +5 more
semanticscholar   +1 more source

Optimal Planning for Timed Partial Order Specifications

IEEE International Conference on Robotics and Automation
This paper addresses the challenge of planning a sequence of tasks to be performed by multiple robots while minimizing the overall completion time subject to timing and precedence constraints.
Kandai Watanabe   +5 more
semanticscholar   +1 more source

Dynamic Partial Orders and Generalized Heaps

1990
Dynamic Partial Orders and Generalized Heaps. Classical and recent results are surveyed in the development of efficient representations of dynamic partial orders by heaps and their generalizations.
openaire   +1 more source

Home - About - Disclaimer - Privacy