Marianne+Csaky

 More results for "Marianne+C..." in  VIDEOS DOCUMENTS AUDIOS GROUPS STAGES/PROFILES ALL

• 

• An introduction to Cellular Automata 1998
• We give basic definitions necessary to understand what are cellular automata, as well as to work with. Some efficient but sometimes problematic concepts as signal, simulation and universality, are poi...
• Rating:        Views: (1009)     Pages: ()     Uploaded: 13-05-09
•  

• 

• An introduction to Cellular Automata 1998
• We give basic definitions necessary to understand what are cellular automata, as well as to work with. Some efficient but sometimes problematic concepts as signal, simulation and universality, are poi...
• Rating:        Views: (1005)     Pages: ()     Uploaded: 13-05-09
•  

• 

• An introduction to Cellular Automata 1998
• We give basic definitions necessary to understand what are cellular automata, as well as to work with. Some efficient but sometimes problematic concepts as signal, simulation and universality, are poi...
• Rating:        Views: (1007)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Densities of Idempotent Measures and Large Deviations 1995 12 citation...
• : Considering measure theory in which the semifield of positive real numbers is replaced by an idempotent semiring leads to the notion of idempotent measure introduced by Maslov. Then, idempotent meas...
• Rating:        Views: (1006)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Syntacticness Cycle-Syntacticness and Shallow Theories 1994
• Solving equations in the free algebra T (F; X) (i.e. unification) uses the two rules: f(~s) = f( ~ t) ! ~s = ~ t (decomposition) and s[x] = x !? (occur-check). These two rules are not correct in quoti...
• Rating:        Views: (1009)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Syntacticness Cycle-Syntacticness and Shallow Theories 1994
• Solving equations in the free algebra T (F; X) (i.e. unification) uses the two rules: f(~s) = f( ~ t) ! ~s = ~ t (decomposition) and s[x] = x !? (occur-check). These two rules are not correct in quoti...
• Rating:        Views: (1005)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Syntacticness Cycle-Syntacticness and Shallow Theories 1994
• Solving equations in the free algebra T (F; X) (i.e. unification) uses the two rules: f(~s) = f( ~ t) ! ~s = ~ t (decomposition) and s[x] = x !? (occur-check). These two rules are not correct in quoti...
• Rating:        Views: (1008)     Pages: ()     Uploaded: 13-05-09
•  

• 

• Automates a galets un etat de l art 1997
• Unit? de recherche associ?e au CNRS n?1398 Automates a galets: un etat de l'art.
• Rating:        Views: (1055)     Pages: ()     Uploaded: 22-01-08
•