Sciweavers

715 search results - page 62 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Capacity-Constrained Design of Resilient Multi-Tier Wireless Mesh Networks
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
R. Raghuraman, Sridhar Iyer
IWPC
2010
IEEE
13 years 7 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 10 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
SOSYM
2010
107views more  SOSYM 2010»
13 years 7 months ago
A UML/OCL framework for the analysis of graph transformation rules
In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, to...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
FOCI
2007
IEEE
14 years 3 months ago
On the Convergence of Immune Algorithms
Immune Algorithms have been used widely and successfully in many computational intelligence areas including optimization. Given the large number of variants of each operator of thi...
Vincenzo Cutello, Giuseppe Nicosia, Mario Romeo, P...