1418 search results - page 17 / 284 » The Dynamic Complexity of Formal Languages |
133
Voted
ICFCA
2005
Springer
15 years 7 months ago
2005
Springer
A key difficulty in the maintenance and evolution of complex software systems is to recognize and understand the implicit dependencies that define contracts that must be respecte...
98
Voted
AUSAI
1998
Springer
15 years 6 months ago
1998
Springer
Agent-based computing in Arti cial Intelligence has given rise to a number of diverse and competing proposals for agent programming languages. Agents, in the sense we are using it...
125
Voted
ARTS
1999
Springer
15 years 6 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
110
Voted
AAAI
2008
15 years 4 months ago
2008
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
198
Voted
IANDC
2008
15 years 1 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...