1278 search results - page 115 / 256 » The Complexity of Weighted Boolean |
PLDI
2009
ACM
14 years 5 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
SPIN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
ICANNGA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...