79 search results - page 7 / 16 » Role of Function Complexity and Network Size in the Generali... |
TIT
2011
13 years 2 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
ICAI
2003
13 years 9 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
BIB
2006
13 years 7 months ago
2006
This article is a critical review of computational techniques used to model, analyse and simulate signalling networks. We propose a conceptual framework, and discuss the role of s...
ASPDAC
2009
ACM
14 years 2 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
This paper discusses the simulation results of a model of biological development for neural networks based on a regulatory genome. The model’s results are analyzed using the fra...