2412 search results - page 293 / 483 » Which Problems Have Strongly Exponential Complexity |
107
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
137
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: The precision of transcriptional regulation is made possible by the specificity of physical interactions between transcription factors and their cognate binding sites ...
117
click to vote
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
150
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
126
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
A central problem in functional verification is to check that a circuit block is producing correct outputs while enforcing that the environment is providing legal inputs. To attac...