Sciweavers

3192 search results - page 102 / 639
» The minimum latency problem
Sort
View
65
Voted
EVOW
2008
Springer
15 years 7 hour ago
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, wit...
Antonio Augusto Chaves, Luiz Antonio Nogueira Lore...
89
Voted
EVOW
2001
Springer
15 years 2 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
ISPDC
2005
IEEE
15 years 3 months ago
On the Implementation and Evaluation of Berkeley Sockets on Maestro2 cluster computing environment
The support on cluster environments of ”legacy protocols” is important to avoid rewriting the code of applications, but this support should not prevent to achieve the maximum ...
Ricardo Guapo, Leonel Sousa, Shinichi Yamagiwa
GCC
2003
Springer
15 years 3 months ago
Improving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
Dongfeng Chen, Shoubao Yang
81
Voted
IPPS
1997
IEEE
15 years 2 months ago
SPAX: A New Parallel Processing System for Commercial Application
Inthispaper, anewparallel processingsystemforcommercial applications, so called SPAX, is described. SPAX cost-effectively overcomes the SMP limitation by providing scalabilityof t...
Woo-Jong Hahn, Kee-Wook Rim, Soo-Won Kim