698 search results - page 87 / 140 » dagstuhl 2007 |
97
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
Abstract. Within Self-reconfiguring systems two basic problems arise: on instruction level, reconfigurable instruction sets make program generation and execution inherently difficu...
84
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
107
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
110
click to vote
DAGSTUHL
2006
15 years 2 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
58
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
The problem of prediction future event given an individual sequence of past events is considered. Predictions are given in form of real numbers pn which are computed by some algori...