Sciweavers

2721 search results - page 2 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
SPIRE
2005
Springer
13 years 11 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
ENDM
2010
130views more  ENDM 2010»
13 years 5 months ago
Experimental Analysis of an Online Trading Algorithm
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
Günter Schmidt, Esther Mohr, Mike Kersch
COR
2006
122views more  COR 2006»
13 years 5 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
13 years 6 months ago
Experimental analysis of dynamic all pairs shortest path algorithms
Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. I...
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
13 years 7 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams