Sciweavers

9588 search results - page 1768 / 1918
» Service Value Networks
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 10 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
128
Voted
IFIP
2009
Springer
15 years 10 months ago
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
Domenic Teuchert, Simon Hauger
151
Voted
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 10 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
CEC
2008
IEEE
15 years 10 months ago
DCA for bot detection
Abstract— Ensuring the security of computers is a nontrivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emer...
Yousof Al-Hammadi, Uwe Aickelin, Julie Greensmith
COMSWARE
2008
IEEE
15 years 10 months ago
An efficient and bandwidth sensitive parallel download scheme in data grids
—For modern scientific applications such as astrophysics, astronomy, aerography, and biology, a large amount of storage space is required because of the large-scale datasets. Dat...
Ruay-Shiung Chang, Chun-Fu Lin, Jiing-Hsing Ruey, ...
« Prev « First page 1768 / 1918 Last » Next »