We consider the problem of scheduling a partially ordered set of unit execution time (UET) tasks on m > 1 processors where there is a communication delay of unit time between any pair of distinct processors. We show that the problem of finding an optimal schedule is NP-hard. A greedy schedule is one where no processor remains idle if there is some task available which it c satisfies could proce...

Modal logic is extended by partially ordering the modalities. The modalities are normal, i.e., commute with either conjunctions or disjunctions and preserve either Truth or Falsity (respectively). The partial order does not conflict with type of modality (K, S4, etc.) although this paper will concentrate on S4 since partially ordered S4 systems appear to be numerous. The partially-ordered norma...

‎in this paper‎, ‎we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.

We generalize the matroid intersection theorem to distributive supermatroids, a structure that extends the matroid to the partially ordered ground set. Distributive supermatroids are special cases of both supermatroids and greedoids, and they generalize polymatroids. This is the first good characterization proved for the intersection problem of an independence system where the ground set is par...

In this paper, we introduce a new class of (semi)hypergroup from a given (partially) quasi-ordered (semi)hypergroup as a generalization of {it "$El$--hyperstructures"}. Then, we study some basic properties and important elements belong to this class.}

The purpose of this paper is to establish fixed point results for a single mapping in a partially ordered modular metric space, and to prove a common fixed point theorem for two self-maps satisfying some weak contractive inequalities.

Mathematical concepts of order and ordering relations play multiple roles in semantic technologies. Discrete totally ordered data characterize both input streams and top-k rank-ordered recommendations and query output, while temporal attributes establish numerical total orders, either over time points or in the more complex case of startend temporal intervals. But also of note are the fully par...

Suppose we are given a partially ordered set, a real-valued weight associated with each element and a positive integer k. We consider the problem which asks to find an ideal of size k of the partially ordered set such that the range of the weights is minimum. We call this problem the minimum-range ideal problem. This paper shows a new and fast 0 ( n log n + m) algorithm for this problem, where ...

A common fixed point result for weakly increasing mappings satisfying generalized contractive type of Zhang in ordered metric spaces are derived.