Sciweavers

2899 search results - page 58 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
CN
2006
99views more  CN 2006»
15 years 1 months ago
High-performance switching based on buffered crossbar fabrics
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, S...
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 1 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
ICASSP
2011
IEEE
14 years 5 months ago
Sparsity-undersampling tradeoff of compressed sensing in the complex domain
In this paper, recently developed ONE-L1 algorithms for compressed sensing are applied to complex-valued signals and sampling matrices. The optimal and iterative solution of ONE-L...
Zai Yang, Cishen Zhang
GECCO
2010
Springer
174views Optimization» more  GECCO 2010»
15 years 4 months ago
Real-coded genetic algorithm benchmarked on noiseless black-box optimization testbed
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
Thanh-Do Tran, Gang-Gyoo Jin
HYBRID
2010
Springer
15 years 8 months ago
A descent algorithm for the optimal control of constrained nonlinear switched dynamical systems
One of the oldest problems in the study of dynamical systems is the calculation of an optimal control. Though the determination of a numerical solution for the general nonconvex o...
Humberto González, Ramanarayan Vasudevan, M...