3653 search results - page 355 / 731 » On Recognizable Timed Languages |
180
click to vote
CP
2003
Springer
16 years 15 hour ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
191
click to vote
AIIDE
2006
15 years 8 months ago
2006
Neuroevolution is a promising learning method in tasks with extremely large state and action spaces and hidden states. Recent advances allow neuroevolution to take place in real t...
180
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
186
click to vote
EMSOFT
2008
Springer
15 years 8 months ago
2008
Springer
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
149
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
One of the challenges for software architects is ensuring that an implemented system faithfully represents its architecture. We describe and demonstrate a tool, called DiscoTect, ...