Sciweavers

12825 search results - page 4 / 2565
» Improved PLSOM algorithm
Sort
View
ICASSP
2008
IEEE
14 years 1 months ago
An improved mu-law proportionate NLMS algorithm
In this paper, we propose an algorithm to improve the performance of the mu-law PNLMS algorithm (MPNLMS) for nonsparse impulse responses. Although the existing MPNLMS algorithm wa...
Ligang Liu, Masahiro Fukumoto, Sachio Saiki
ICNC
2009
Springer
14 years 2 months ago
Reducing Boarding Time: Synthesis of Improved Genetic Algorithms
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
Kang Wang
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
11 years 10 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
14 years 1 months ago
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Ruka Tanahashi