4502 search results - page 238 / 901 » Regular Model Checking |
163
Voted
FMSD
2007
15 years 6 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
167
click to vote
SIROCCO
2000
15 years 7 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
196
click to vote
LATA
2011
Springer
14 years 9 months ago
2011
Springer
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
161
click to vote
FORTE
2008
15 years 7 months ago
2008
Abstract. The Signal Calculus is an asynchronous process calculus featuring multicast communication. It relies on explicit modeling of the communication structure of the network (c...
205
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...