Sciweavers

1857 search results - page 105 / 372
» Minimum Degree Orderings
Sort
View
EVOW
2001
Springer
15 years 11 months ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
COCOON
2008
Springer
15 years 8 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
HCI
2007
15 years 8 months ago
Suppressing Competition in a Computer-Supported Collaborative Learning System
The purpose of this study is to explore how student competition using the tit-for-tat strategy could be remedied with a minimum design change in order to support student to collabo...
Kwangsu Cho, Bosung Kim
ICASSP
2010
IEEE
15 years 6 months ago
MMSE based noise PSD tracking with low complexity
Most speech enhancement algorithms heavily depend on the noise power spectral density (PSD). Because this quantity is unknown in practice, estimation from the noisy data is necess...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
AUTOMATICA
2008
82views more  AUTOMATICA 2008»
15 years 6 months ago
Iterative minimization of H2 control performance criteria
Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance crit...
Alexandre S. Bazanella, Michel Gevers, Ljubisa Mis...