A sane Algorithme for the Synthesis of LISP Functions from Example Problems: The "Boyer and Moore Algorithm".
Yves KodratoffJean FarguesPublished in: AISB/GI (ECAI) (1978)
Keyphrases
- detection algorithm
- benchmark problems
- particle swarm optimization
- similarity measure
- learning algorithm
- np hard
- optimization algorithm
- optimization problems
- times faster
- dynamic programming
- k means
- preprocessing
- computational complexity
- optimal solution
- image segmentation
- matching algorithm
- improved algorithm
- worst case
- expectation maximization
- computational cost
- np complete
- high accuracy
- experimental evaluation
- cost function
- search algorithm
- test problems
- optimal or near optimal