The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic or Lagrangian-relaxation techniques. Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best...

In this paper, using α—admissibility and the concept of simulation functions, some near-fixed point results in setting metric interval normed spaces are established. The have been proved Z-contractions.

Abstract : Let be a 2nd order ODE. By Cartan equivalence method, we will study the local equivalence problem under the transformations group of time-fixed coordinates. We are going to solve this problem by an applicable method which has been recognized by R. Gardner, and classify them.   

In real-time (RT) computing systems, a service function execution including an output action is typically subject to a deadline. Scheduling algorithms play a significant role in the design of such systems. They are the major factor in determining the execution safety, i.e., the possibility of always executing control service functions without missing deadlines in a given execution engine posses...

In this paper, we study the problem of solving integer range constraints that arise in many static program analysis problems. In particular, we present the first polynomial time algorithm for a general class of integer range constraints. In contrast with abstract interpretation techniques based on widenings and narrowings, our algorithm computes, in polynomial time, the optimal solution of the ...