Sciweavers

1242 search results - page 16 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
JCP
2007
150views more  JCP 2007»
13 years 7 months ago
Bayesian Networks and Evidence Theory to Model Complex Systems Reliability
Abstract— This paper deals with the use of Bayesian Networks to compute system reliability of complex systems under epistemic uncertainty. In the context of incompleteness of rel...
Christophe Simon, Philippe Weber, Eric Levrat
NIPS
2000
13 years 8 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 5 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
CASC
2006
Springer
100views Mathematics» more  CASC 2006»
13 years 11 months ago
Reducing Computational Costs in the Basic Perturbation Lemma
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
Ainhoa Berciano, María José Jim&eacu...