Sciweavers

3136 search results - page 379 / 628
» Complex networks and evolutionary computation
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 12 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
166
Voted
ICNP
2006
IEEE
16 years 21 days 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
16 years 7 days 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
EUROPAR
2005
Springer
16 years 5 days ago
An Approach to Performance Prediction for Parallel Applications
Abstract. Accurately modeling and predicting performance for largescale applications becomes increasingly difficult as system complexity scales dramatically. Analytic predictive mo...
Engin Ipek, Bronis R. de Supinski, Martin Schulz, ...
INFOCOM
2009
IEEE
16 years 1 months ago
Nuclei: GPU-Accelerated Many-Core Network Coding
—While it is a well known result that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its...
Hassan Shojania, Baochun Li, Xin Wang