Sciweavers

12257 search results - page 13 / 2452
» Analysis of Algorithms
Sort
View
AUTOMATICA
2004
92views more  AUTOMATICA 2004»
13 years 7 months ago
Randomized algorithms for quadratic stability of quantized sampled-data systems,
In this paper, we present a novel development of randomized algorithms for quadratic stability analysis of sampled-data systems with memoryless quantizers. The speci
Hideaki Ishii, Tamer Basar, Roberto Tempo
PR
2008
129views more  PR 2008»
13 years 7 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
CN
2007
104views more  CN 2007»
13 years 7 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 2 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
EMO
2005
Springer
175views Optimization» more  EMO 2005»
14 years 1 months ago
A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
R. Lyndon While