In this paper, we introduce a new concept on a complete partially ordered Dmetric space by using the concept of D-metric space it's called ∇ -distance which is a generalized of the concept of a w-distance. The main result of our paper is prove some fixed point theorems in complete partially ordered D-metric space. Mathematics Subject Classification: 47H10, 54H25

We describe a novel heuristic search algorithm, called Sweep A*, that exploits the regular structure of partially ordered graphs to substantially reduce the memory requirements of search. We show that it outperforms previous search algorithms in optimally aligning multiple protein or DNA sequences, an important problem in bioinformatics. Sweep A* also promises to be effective for other search p...

1. Let F be a partially ordered vector space with an order unit e. It is well known that the class 5DÎ of maximal ideals of V is in one-one correspondence with the class K of normalized positive linear functionals, in the sense that to each ME^SR corresponds a positive linear functional <¡>m with M as its null-space and with M(e) = 1. A maximal ideal MG 90? is said to be extreme if <pM is an...

‎a common approach to determine efficient solutions of a multiple objective optimization problem‎ ‎is reformulating it to a parameter dependent scalar optimization problem‎. ‎this reformulation is called scalarization approach‎. here, a well-known scalarization approach named pascoletti-serafini scalarization is considered‎. first, some difficulties of this scalarization are discussed and then ...

We study chains in an H-closed topological partially ordered space. We give sufficient conditions for a maximal chain L in an H-closed topological partially ordered space such that L contains a maximal (minimal) element. Also we give sufficient conditions for a linearly ordered topological partially ordered space to be H-closed. We prove that any H-closed topological semilattice contains a zero...