Sciweavers

1404 search results - page 146 / 281
» On General Laws of Complex Networks
Sort
View
MOBICOM
2005
ACM
15 years 10 months ago
An analytical model for the dimensioning of a GPRS/EDGE network with a capacity constraint on a group of cells
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
Georges Nogueira, Bruno Baynat, Pierre Eisenmann
VTC
2008
IEEE
140views Communications» more  VTC 2008»
15 years 10 months ago
Diversity Combining of Signals with Different Modulation Levels in Cooperative Relay Networks
In digital cooperative relaying, signals from the source-destination and relay-destination links are combined at the destination to achieve spatial diversity. These signals do not ...
Akram Bin Sediq, Halim Yanikomeroglu
BMCBI
2011
14 years 8 months ago
A hierarchical Bayesian network approach for linkage disequilibrium modeling and data-dimensionality reduction prior to genome-w
Background: Discovering the genetic basis of common genetic diseases in the human genome represents a public health issue. However, the dimensionality of the genetic data (up to 1...
Raphael Mourad, Christine Sinoquet, Philippe Leray
ICNP
2006
IEEE
15 years 10 months ago
Robust Path-Vector Routing Despite Inconsistent Route Preferences
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
Aaron D. Jaggard, Vijay Ramachandran
QSHINE
2005
IEEE
15 years 10 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves