Sciweavers

4839 search results - page 142 / 968
» A survey of computational complexity results in systems and ...
Sort
View
82
Voted
LICS
2006
IEEE
15 years 7 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco
SAFECOMP
2009
Springer
15 years 8 months ago
Establishing a Framework for Dynamic Risk Management in 'Intelligent' Aero-Engine Control
The behaviour of control functions in safety critical software systems is typically bounded to prevent the occurrence of known system level hazards. These bounds are typically deri...
Zeshan Kurd, Tim Kelly, John A. McDermid, Radu Cal...
113
Voted
DFG
2009
Springer
15 years 8 months ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
15 years 5 months ago
Parameter approximate dynamic optimization for PSO systems
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
Qi Kang, Lei Wang, Derong Liu, Qidi Wu
GLOBECOM
2006
IEEE
15 years 8 months ago
Reduced Complexity Vector Precoding for the Multiuser Downlink
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...
René Habendorf, Ines Riedel, Gerhard Fettwe...