Sciweavers

3875 search results - page 324 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
CJ
2010
128views more  CJ 2010»
15 years 7 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
CSDA
2006
98views more  CSDA 2006»
15 years 6 months ago
Frequency estimation of undamped exponential signals using genetic algorithms
: In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation usi...
Amit Mitra, Debasis Kundu, Gunjan Agrawal
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 1 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
IRREGULAR
1995
Springer
15 years 10 months ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
DAGSTUHL
2007
15 years 8 months ago
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
Dario Andrea Bini, Bruno Iannazzo, Beatrice Meini,...