270 search results - page 8 / 54 » Dynamic Complexity Theory Revisited |
98
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
128
Voted
PODS
1994
ACM
15 years 3 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
101
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: High complexity is considered a hallmark of living systems. Here we investigate the complexity of temporal gene expression patterns using the concept of Permutation En...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— For many applications, the control of a complex nonlinear system can be made easier by modeling the system as a collection of simplified hybrid modes, each representing a part...
82
Voted
ESANN
2007
15 years 1 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...