Interpolative Boolean algebra based multicriteria routing algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical Aggregation Based on Interpolative Realization of Boolean Algebra

In this paper, aggregation is treated as a logical and/or pseudo-logical operation what is important from many points of view such as adequacy and interpretations.

متن کامل

Supplier Selection Using Interpolative Boolean Algebra and Logic Aggregation

The interest of the decision makers in the selection process of suppliers is constantly growing as a reliable supplier reduces costs and improves the quality of products/services. This process is essentially reducible to the problem of multi-attribute decision-making. Namely, the large number of quantitative and qualitative attributes is considered. This paper presents a model of supplier selec...

متن کامل

Introducing Interpolative Boolean algebra into Intuitionistic fuzzy sets

In this paper, we introduce Interpolative Boolean algebra (IBA) as a suitable algebra for intuitionistic fuzzy sets (IFSs). IBA is [0,1]-valued realization of Boolean algebra, consistent with Boolean axioms and theorems. IFS theory takes into account both membership and non-membership function, so it can be viewed as a generalization of the traditional fuzzy set theory. We propose a realization...

متن کامل

A Consensus Model in Group Decision Making Based on Interpolative Boolean Algebra

The aim of this paper is to propose a soft consensus model based on interpolative Boolean algebra for group decision making problems. Consensus degrees are calculated on three levels (on pairs of alternatives, alternatives, collective level) by means of pseudo-logical aggregation. The relation of equivalence is employed as a similarity measure among experts' opinions. In fact real-valued realiz...

متن کامل

EmptyHeaded: Boolean Algebra Based Graph Processing

There are two types of high-performance graph processing engines: lowand high-level engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures and computation models but require users to write low-level imperative code; hence ensuring that efficiency is the burden of the user. In high-level engines users write in query languages like datalog (SociaLite) or SQL (Grai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: YUJOR

سال: 2015

ISSN: 0354-0243,1820-743X

DOI: 10.2298/yjor140430029j