This paper proposes and evaluates prioritized direct shared-memory multiprocessor networks. We use three components to implement prioritized networks, namely, priority-based link arbitration, priority inheritance , and dynamic virtual channels. The two major results from our study are: (i) adding priorities to direct shared-memory multiprocessor networks can lead to reduced average transaction ...

In this paper, we firstly propose some generalized prioritized aggregation operators to aggregate the intuitionistic fuzzy values (IFVs), such as the generalized intuitionistic fuzzy prioritized weighted geometric (GIFPWG) operator and the generalized intuitionistic fuzzy prioritized weighted average (GIFPWA) operator. It is shown that some existing intuitionistic fuzzy aggregation operators ar...

We demonstrate the technological value of non-monotonic logics by an example: We use prioritized defaults for candidate generation in diagnosis from first principles. We implement this non-monotonic logic by TMS similar to default logic. Prioritized defaults allow an easy formu­ lation of a diagnosis problem including state­ ments such as 'eletrical parts are more reliable than mechanical ones'...

In this paper we study boolean game with prioritized norms. Norms distinguish illegal strategies from legal strategies. Notions like legal strategy and legal Nash equilibrium are introduced. Our formal model is a combination of (weighted) boolean game and so called (prioritized) input/output logic. After formally presenting the model, we use examples to show that non-optimal Nash equilibrium ca...

It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental issue of how preferences impact the semantics and rankings in a relation is not resolved. In this paper, we model a user preference term involving one attribute as a hierarchy of its underlying data values and formalise...

This work addresses the issue of prioritized reasoning in the context of logic programming. The case of preference conditions involving atoms is considered and a refinement of the comparison method of the ASO semantics is presented. The paper introduces the concept of “choice”, as a set of preference rules describing common choice options in different contexts and proposes a new semantics that ...