1772 search results - page 288 / 355 » Classifying Problems into Complexity Classes |
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
APAL
2010
13 years 10 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
IWCIA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
FCCM
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...