Sciweavers

3229 search results - page 617 / 646
» The Theory of Timed Automata
Sort
View
EMSOFT
2009
Springer
13 years 11 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ACMSE
2006
ACM
13 years 11 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
ATAL
2006
Springer
13 years 11 months ago
Integrating agent-oriented methodologies with UML-AT
There are many methodological approaches for Agent-Oriented Software Engineering, each one focusing on some features of multi-agent systems, but leaving others underdefined. For t...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
ATAL
2006
Springer
13 years 11 months ago
Efficient agent-based models for non-genomic evolution
Modeling dynamical systems composed of aggregations of primitive proteins is critical to the field of astrobiological science, which studies early evolutionary structures dealing ...
Nachi Gupta, Adrian K. Agogino, Kagan Tumer
ATAL
2006
Springer
13 years 11 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...