Sciweavers

22 search results - page 2 / 5
» Matrix Analytic Methods in Branching processes
Sort
View
CEC
2005
IEEE
13 years 11 months ago
Dynamic niching in evolution strategies with covariance matrix adaptation
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identiï¬...
Ofer M. Shir, Thomas Bäck
HIPC
2005
Springer
13 years 11 months ago
Performance Study of LU Decomposition on the Programmable GPU
With the increasing programmability of GPUs (graphics processing units), these units are emerging as an attractive computing platform not only for traditional graphics computation ...
Fumihiko Ino, Manabu Matsui, Keigo Goda, Kenichi H...
ICASSP
2008
IEEE
14 years 7 days ago
Distributed average consensus with increased convergence rate
The average consensus problem in the distributed signal processing context is addressed by linear iterative algorithms, with asymptotic convergence to the consensus. The convergen...
Boris N. Oreshkin, Tuncer C. Aysal, Mark Coates
ICASSP
2008
IEEE
14 years 7 days ago
Adaptive resolution-constrained scalar multiple-description coding
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
QUESTA
2006
115views more  QUESTA 2006»
13 years 5 months ago
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study prio...
Benny Van Houdt, Chris Blondia