1197 search results - page 140 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we introduce robust cyclic space– frequency (CSF) filtering for systems combining bit–interleaved coded modulation (BICM) and orthogonal frequency division ...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
KI
2005
Springer
14 years 1 months ago
2005
Springer
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
CP
2011
Springer
12 years 8 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...