2233 search results - page 105 / 447 » On the Complexity of Theory Curbing |
158
click to vote
COR
2008
15 years 6 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
217
click to vote
AML
2011
15 years 1 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
181
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
170
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
171
click to vote
JSAC
2008
15 years 6 months ago
2008
We consider large MIMO systems, where by `large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense i...