15033 search results - page 9 / 3007 » Complexity Theory and Algorithms |
COCO
2000
Springer
15 years 2 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
72
Voted
CCS
2007
ACM
15 years 3 months ago
2007
ACM
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...