Sciweavers

91 search results - page 12 / 19
» The Second Calculus of Binary Relations
Sort
View
IJON
2006
103views more  IJON 2006»
13 years 7 months ago
Evolutionary system for automatically constructing and adapting radial basis function networks
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
Daniel Manrique, Juan Rios, Alfonso Rodrígu...
CSDA
2007
94views more  CSDA 2007»
13 years 7 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen
ENTCS
2010
111views more  ENTCS 2010»
13 years 4 months ago
Fundamental Nano-Patterns to Characterize and Classify Java Methods
Fundamental nano-patterns are simple, static, binary properties of Java methods, such as ObjectCreator and Recursive. We present a provisional catalogue of 17 such nano-patterns. ...
Jeremy Singer, Gavin Brown, Mikel Luján, Ad...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 7 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
STACS
2010
Springer
14 years 2 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey