Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) 
and ANP (Analytic Network Process)

Kazutomo Nishizawa

The search session has expired. Please query the service again.

Displaying similar documents to “Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)”

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2009)

RAIRO - Operations Research

Similarity:

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually....

Square-root rule of two-dimensional bandwidth problem

Lan Lin, Yixun Lin (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The bandwidth minimization problem is of significance in network communication and related areas. Let be a graph of vertices. The two-dimensional bandwidth () of is the minimum value of the maximum distance between adjacent vertices when is embedded into an × grid in the plane. As a discrete optimization problem, determining () is NP-hard in general. However, exact results for this parameter can be derived for some special classes of graphs. This...

Square-root rule of two-dimensional bandwidth problem

Lan Lin, Yixun Lin (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

Solving multi-agent scheduling problems on parallel machines with a global objective function

F. Sadi, A. Soukhal, J.-C. Billaut (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this study, we consider a scheduling environment with ( ≥ 1) parallel machines. The set of jobs to schedule is divided into disjoint subsets. Each subset of jobs is associated with one agent. The agents compete to perform their jobs on common resources. The objective is to find a schedule that minimizes a global objective function , while maintaining the regular objective function of each agent, , at a level no greater than a fixed value, ...

Normalization of edit sequences for text synchronization

Rafael C. Carrasco, Alexander Sánchez Díaz (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

It often occurs that local copies of a text are modified by users but that the local modifications are not synchronized (thus allowing the merged text to become the source for later editions) until later when, for instance the network connection is reestablished. Since text editions usually affect a small fraction of the whole content, the history of edit operations provides a compact representation of the modified file. In this paper, we define a normal form for these records...

Normalization of edit sequences for text synchronization

Rafael C. Carrasco, Alexander Sánchez Díaz (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

Some aspects of the local theory of generalized Dhombres functional equations in the complex domain

Jörg Tomaschek (2012)

ESAIM: Proceedings

Similarity:

We study the generalized Dhombres functional equation (()) = (()) in the complex domain. The function is given and we are looking for solutions with (0) = and is a primitive root of unity of order ≥ 2. All formal solutions for this case are described in this work, for the situation where can be transformed into a function which is linearizable and local analytic in a neighbourhood...

Fast approximation of minimum multicast congestion – Implementation VERSUS Theory

Andreas Baltz, Anand Srivastav (2010)

RAIRO - Operations Research

Similarity:

The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with edges and multicast requests, an OPT + exp(1)ln)-approximation can be computed in lnln) time, where bounds the time for computing an -approximate minimum Steiner tree. Moreover, we present...

An Extended Opportunity-Based Age Replacement Policy

Bermawi P. Iskandar, Hiroaki Sandoh (2010)

RAIRO - Operations Research

Similarity:

The present study proposes an extended opportunity-based age replacement policy where opportunities occur according to a Poisson process. When the age, of the system satisfies for a prespecified value , a corrective replacement is conducted if the objective system fails. In case satisfies for another prespecified value , we take an opportunity to preventively replace the system by a new one with probability , and do not take the opportunity with probability . At the moment reaches...

Survival probabilities of autoregressive processes

Christoph Baumgarten (2014)

ESAIM: Probability and Statistics

Similarity:

Given an autoregressive process of order ( = + ··· + + where the random variables , ,... are i.i.d.), we study the asymptotic behaviour of the probability that the process does not exceed a constant barrier up to time (survival or persistence probability). Depending on the coefficients ,...,...