Sciweavers

3204 search results - page 558 / 641
» The b-chromatic Number of a Graph
Sort
View
COMGEO
2008
ACM
13 years 9 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 9 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
AMC
2006
100views more  AMC 2006»
13 years 9 months ago
Reliability evaluation of multi-component cold-standby redundant systems
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
ENTCS
2008
99views more  ENTCS 2008»
13 years 9 months ago
Visual Specification of Metrics for Domain Specific Visual Languages
We present a Domain Specific Visual Language (DSVL) for the definition of metrics for other DSVLs. The metrics language has been defined using meta-modelling, and includes some of...
Esther Guerra, Paloma Díaz, Juan de Lara
ENTCS
2008
95views more  ENTCS 2008»
13 years 9 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...