Sciweavers

1563 search results - page 15 / 313
» Performance comparison of memetic algorithms
Sort
View
CCR
2004
150views more  CCR 2004»
13 years 7 months ago
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
TCP congestion control has been designed to ensure Internet stability along with fair and efficient allocation of the network bandwidth. During the last decade, many congestion co...
Luigi Alfredo Grieco, Saverio Mascolo
ISHPC
2003
Springer
14 years 21 days ago
Performance Study of a Whole Genome Comparison Tool on a Hyper-Threading Multiprocessor
We developed a multithreaded parallel implementation of a sequence alignment algorithm that is able to align whole genomes with reliable output and reasonable cost. This paper pres...
Juan del Cuvillo, Xinmin Tian, Guang R. Gao, Milin...
IPPS
1998
IEEE
13 years 11 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
TJS
2008
78views more  TJS 2008»
13 years 7 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
EC
2007
167views ECommerce» more  EC 2007»
13 years 7 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud