Sciweavers

4781 search results - page 308 / 957
» Online algorithms for network design
Sort
View
WOSP
2005
ACM
16 years 10 days ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills
ICASSP
2011
IEEE
14 years 10 months ago
Beamforming design for multi-user two-way relaying with MIMO amplify and forward relays
Relays represent a promising approach to extend the cell coverage, combat the strong shadowing effects as well as guarantee the QoS in dense networks. Among the numerous existing ...
Jianshu Zhang, Florian Roemer, Martin Haardt
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
ICC
2007
IEEE
123views Communications» more  ICC 2007»
16 years 1 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
16 years 23 days ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...