3192 search results - page 218 / 639 » The minimum latency problem |
109
click to vote
CONEXT
2008
ACM
15 years 6 months ago
2008
ACM
We address the problem of finding indirect overlay paths that reduce the latency between pairs of nodes in an overlay. To this end we propose to rely on an Internet Coordinate Sys...
137
click to vote
ALGOSENSORS
2009
Springer
15 years 11 months ago
2009
Springer
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
116
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
127
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (F...
129
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...