Sciweavers

446 search results - page 12 / 90
» Convergence and rate of convergence of a simple ant model
Sort
View
AUTOMATICA
2002
97views more  AUTOMATICA 2002»
14 years 9 months ago
Frequency-domain subspace system identification using non-parametric noise models
- In the general case of non-uniformly spaced frequency domain data and/or arbitrarily colored disturbing noise, the frequency domain subspace identification algorithms described i...
Rik Pintelon
INTERSPEECH
2010
14 years 4 months ago
Semi-supervised training of Gaussian mixture models by conditional entropy minimization
In this paper, we propose a new semi-supervised training method for Gaussian Mixture Models. We add a conditional entropy minimizer to the maximum mutual information criteria, whi...
Jui-Ting Huang, Mark Hasegawa-Johnson
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 3 months ago
Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
Manuel Förster, Bettina Bickel, Bernd Hardung...
ICC
2009
IEEE
154views Communications» more  ICC 2009»
15 years 4 months ago
Load Balancing vs. Distributed Rate Limiting: An Unifying Framework for Cloud Control
— With the expansion of cloud-based services, the question as to how to control usage of such large distributed systems has become increasingly important. Load balancing (LB), an...
Rade Stanojevic, Robert Shorten
CORR
2006
Springer
172views Education» more  CORR 2006»
14 years 9 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan