In this paper, a new algebraic representation by the non-Archimedean fields is proposed to model stratified/ranked knowledge bases. The non-Archimedean representation is in the form of the non-Archimedean polynomials. With the nonArchimedean representation, the most widely used ordering strategies are easily induced and compared. Moreover, a framework of prioritized merging operators using the ...

Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. In this paper we present a method for finding solvable priority schemes for such prioritized and decoupled pl...

Single-valued neutrosophic hesitant fuzzy set (SVNHFS) is a combination of single-valued neutrosophic set and hesitant fuzzy set, and its aggregation tools play an important role in the multiple criteria decision-making (MCDM) process. This paper investigates the MCDM problems in which the criteria under SVNHF environment are in different priority levels. First, the generalized single-valued ne...

This paper describes a fast algorithm for the prioritized kinematic control of redundant manipulators. Building on the classical prioritized task framework, the focus is set on efficient computation and handling of inequality constraints throughout priority levels. Classical approaches that tend to account for inequality constraints through potential fields are computationally competitive but h...

Regression test case prioritization optimizes the ordering of test cases to be executed to meet some criteria like maximum code coverage or high rate of fault detection. In prior work we prioritized test cases according to a hybrid technique using variable based method that combined both selection and prioritization. We inferred in our approach that variables are vital source of changes in the ...

The Hildreth’s algorithm is a row action method for solving large systems of inequalities. This algorithm is efficient for problems with sparse matrices, as opposed to direct methods such as Gaussian elimination or QR-factorization. We apply the Hildreth’s algorithm, as well as a randomized version, along with prioritized selection of the inequalities, to efficiently detect the highest priority...

Different quality-of-service (QoS) required types of multimedia services and need a guaranteed service rate in wireless multimedia networks. When the number of user arrivals increases, bandwidth degradations may occur due to limited bandwidth nature of cellular wireless networks. The bandwidth that should be assigned to user cannot be met for QoS provisioning in congested network. In this paper...

Simplified neutrosophic sets (SNSs) can effectively solve the uncertainty problems, especially those involving the indeterminate and inconsistent information. Considering the advantages of SNSs, a new approach for multi-criteria decision-making (MCDM) problems is developed under the simplified neutrosophic environment. First, the prioritized weighted average operator and prioritized weighted ge...

Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. In this paper we present a method for finding solvable priority schemes for such prioritized and decoupled pl...

The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz’ parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed va...