Sciweavers

4565 search results - page 94 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
CISS
2008
IEEE
14 years 4 months ago
Optimization via communication networks
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
Matthew Andrews
EC
2010
158views ECommerce» more  EC 2010»
13 years 7 months ago
An Efficient Algorithm for Computing Hypervolume Contributions
The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest lo...
Karl Bringmann, Tobias Friedrich
ISNN
2011
Springer
13 years 1 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
CDC
2010
IEEE
163views Control Systems» more  CDC 2010»
13 years 5 months ago
A distributed joint-learning and auction algorithm for target assignment
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
Teymur Sadikhov, Minghui Zhu, Sonia Martíne...
ICASSP
2011
IEEE
13 years 1 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos