Sciweavers

2814 search results - page 193 / 563
» Multicriteria Network Design Using Evolutionary Algorithm
Sort
View
118
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 3 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
141
Voted
GECCO
2008
Springer
229views Optimization» more  GECCO 2008»
15 years 4 months ago
EIN-WUM: an AIS-based algorithm for web usage mining
With the ever expanding Web and the information published on it, effective tools for managing such data and presenting information to users based on their needs are becoming nece...
Adel Torkaman Rahmani, B. Hoda Helmi
176
Voted
MSS
2005
IEEE
182views Hardware» more  MSS 2005»
15 years 9 months ago
Evaluation of Advanced TCP Stacks in the iSCSI Environment using Simulation Model
Enterprise storage demands have overwhelmed traditional storage mechanisms and have led to the development of Storage Area Networks (SANs). This has resulted in the design of SCSI...
Girish Motwani, K. Gopinath
123
Voted
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
15 years 9 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
SAC
2010
ACM
15 years 10 months ago
Coverage-hole trap model in target tracking using distributed relay-robot network
Target tracking is an important issue in wireless sensor network applications. In this paper, we design a Coverage-Hole Trap Model (CTM) based on a system that contains one moving...
Huawei Miao, Chia-Ching Ooi, Xiaowen Wu, Christian...