- Full text PDF available (7)
- This year (0)
- Last 5 years (6)
- Last 10 years (8)
Journals and Conferences
The paper is concerned with the timing analysis of a class digital systems we call mixed asynchronousssynchronous systems. In such a system, each computation module is either synchronous i.e. clocked or asynchronous i.e. selftimed. The communication between modules is assumed to be selftimed for all modules. We i n troduce a graph model called MASS for… (More)
In this paper, we introduce modal operators for Intuitionistic Fuzzy Matrix and derive some results.
We introduce the concept of sandwich set of two fuzzy matrices.By using the new concept of sandwich set, we provide a method for finding a semi inverse of max-min product of fuzzy matrices. 1. Introduction Generalized inverse of matrices and its applications are studied by Rao and Mitra. Ren et.al introduced the concept of sandwich sets of matrices.… (More)
In this paper, we define the various g-inverses of an intuitionistic fuzzy matrices, left (right) cancelable intuitionistic fuzzy matrices and derive the equivalent condition for the existence of the generalized inverses. We also study the relation between the minus-ordering and the various g–inverses of an intuitionistic fuzzy matrix.
This paper considers the problem of on-line job scheduling on M identical machines with hard deadlines. The processing time and delay time of a job are known only on its arrival. Jobs are discarded if they do not meet delay time requirement. The objective of the present work is to minimize the number of tardy jobs. A lower bound of competitive ratio when… (More)
With the increase in the resolution of images, arises the need to compress these images effectively without much loss, for easy storage and transmission. Sparse matrices are matrices that have majority of their elements as zeroes, which brings in the possibility of storing just the non-zero elements in a space efficient manner using various formats. Images,… (More)
A broom graph B n,d is a specific kind of graph on n vertices, having a path P with d vertices and n-d pendant vertices, all of these being adjacent to either the origin u or the terminus v of the path P. Here we consider the eccentric graph of B n,d and obtain its structure, besides deriving its eccentric connectivity index and domination number. 1.… (More)
Joseph and Kwack (see ) introduced the notion of (θ, s)-continuous functions in order to investigate S-closed spaces. The aim of this paper is to introduce fuzzy almost contra γ-continuous functions related to S-closed spaces and to investigate some properties of such fuzzy functions.
To address the performance analysis of Boruvka's algorithms by analyzing different cache performance parameters in VTUNE Amplifier. In general, Minimum Spanning Tree [MST] is computed with various algorithms, Boruvka's being the oldest and efficient. MST is widely used in applications like search engines, pattern recognition, routing algorithms, network… (More)