2905 search results - page 181 / 581 » Formal Memetic Algorithms |
MEMOCODE
2003
IEEE
14 years 3 months ago
2003
IEEE
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
TSD
2001
Springer
14 years 2 months ago
2001
Springer
This paper deals with the effective implementation of the new Czech morphological analyser ajka which is based on the algorithmic description of the Czech formal morphology. First...
KBSE
2000
IEEE
14 years 2 months ago
2000
IEEE
Lightweight formal modeling and automatic analysis were used to explore the design of the Intentional Naming System (INS), a new scheme for resource discovery in a dynamic network...
EICS
2010
ACM
14 years 2 months ago
2010
ACM
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
ISSS
1999
IEEE
14 years 2 months ago
1999
IEEE
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...