Displaying similar documents to “Summarizing sensors data in vehicular ad hoc networks”

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....

Inf-datalog, Modal Logic and Complexities

Eugénie Foustoucos, Irène Guessarian (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking ( computing all nodes satisfying a formula in a given structure) has 1. quadratic...

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

Kazutomo Nishizawa (2010)

RAIRO - Operations Research

Similarity:

In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to is point , the nearest point to is not necessarily point . Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance...

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:

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...

On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes

Ján Maňuch, Ladislav Stacho (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of internally node disjoint dipaths connecting all pairs of distinct nodes in the binary -dimensional hypercube, where . This system of dipaths constitutes a routing protocol that remains functional in the presence of up to faults (of nodes and/or links). The problem of constructing such protocols...

Risk bounds for new M-estimation problems

Nabil Rachdi, Jean-Claude Fort, Thierry Klein (2013)

ESAIM: Probability and Statistics

Similarity:

In this paper, we consider a new framework where two types of data are available: experimental data supposed to be i.i.d from and outputs from a simulated reduced model. We develop a procedure for parameter estimation to characterize a feature of the phenomenon . We prove a risk bound qualifying the proposed procedure in terms of the number of experimental data , reduced model complexity...

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:

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...

Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List

Saïd Hanafi, Arnaud Fréville (2010)

RAIRO - Operations Research

Similarity:

The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called REM-...

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, ...