Sciweavers

3136 search results - page 10 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
INFOCOM
2000
IEEE
15 years 4 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...
RTAS
2002
IEEE
15 years 4 months ago
Performance Comparison of Dynamic Voltage Scaling Algorithms for Hard Real-Time Systems
Dynamic voltage scaling (DVS) is an effective low-power design technique for embedded real-time systems. In recent years, many DVS algorithms have been proposed for reducing the e...
Woonseok Kim, Dongkun Shin, Han-Saem Yun, Jihong K...
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
15 years 6 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen
EMO
2001
Springer
209views Optimization» more  EMO 2001»
15 years 4 months ago
Comparison of Evolutionary and Deterministic Multiobjective Algorithms for Dose Optimization in Brachytherapy
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
Natasa Milickovic, Michael Lahanas, Dimos Baltas, ...
ANTSW
2004
Springer
15 years 5 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...