3690 search results - page 39 / 738 » Computation with classical sequents |
ITNG
2007
IEEE
14 years 5 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
CSL
2011
Springer
13 years 5 months ago
2011
Springer
The automatic recognition of user’s communicative style within a spoken dialog system framework, including the affective aspects, has received increased attention in the past f...
DAGSTUHL
2008
14 years 6 days ago
2008
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
ISTCS
1993
Springer
14 years 2 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
ICANN
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...