Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Memetic algorithm A genetic algorithm or evolutionary algorithm which includes a non-genentic local search to improve genotypes. The term comes from the Richard Dawkin's term "meme". One big difference between memes and genes is that memes are processed and possibly improved by the people that hold them - something that cannot happen to genes. It is this advantage that the memetic algorithm has over simple genetic or evolutionary algorithms. These algorithms are useful in solving complex problems, such as the "Travelling Salesman Problem," which involves finding the shortest path through a large number of nodes, or in creating artificial life to test evolutionary theories. Memetic algorithms are one kind of metaheuristic. UNLP memetic algorithms home page (http://www.ing.unlp.edu.ar/cetad/mos/memetic_home.html). (07 July 1997). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-c-e-e-g-h-i-i-l-m-m-m-o-r-t-t" | |
-4 letters: meteoritical. | |
-5 letters: algorithmic, geometrical, heliometric, legitimator, logarithmic, microgamete, recommittal, theorematic, theoretical. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4D 45 4D 45 54 49 43      41 4C 47 4F 52 49 54 48 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001101 01000101 01001101 01000101 01010100 01001001 01000011 00100000 01000001 01001100 01000111 01001111 01010010 01001001 01010100 01001000 01001101 |
HTML Code (1990) (references)M E M E T I C   A L G O R I T H M |
ISO 10646 (1991-1993) (references)004D 0045 004D 0045 0054 0049 0043      0041 004C 0047 004F 0052 0049 0054 0048 004D |
Encryption (beginner's substitution cypher): (references)473947395443372354641495243544247 |
| 1. Anagrams 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.