Sciweavers

1532 search results - page 106 / 307
» The Symbol Grounding Problem
Sort
View
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
15 years 5 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ENTCS
2008
105views more  ENTCS 2008»
15 years 4 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
TNN
1998
92views more  TNN 1998»
15 years 4 months ago
Inductive inference from noisy examples using the hybrid finite state filter
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
Marco Gori, Marco Maggini, Enrico Martinelli, Giov...
ESWA
2010
158views more  ESWA 2010»
15 years 1 months ago
Interval competitive agglomeration clustering algorithm
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
ICAT
2006
IEEE
15 years 10 months ago
Tangible Cubes as Programming Objects
In this paper, we describe early results in the development of an alternative programming method which uses large, three-dimensional acrylic blocks to construct programming sequen...
Andrew C. Smith