𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Search algorithms for bis-sequential machines

✍ Scribed by Tse-Yun Feng

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
875 KB
Volume
8
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial time algorithm to infer seq
A polynomial time algorithm to infer sequential machines
✍ Katsuhiko Takahashi; Akio Fujiyoshi; Takumi Kasai πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 999 KB

## Abstract In this paper, we will describe an algorithm which infers a Moore‐type sequential machine from examples of inputs and outputs of an unknown Moore‐type sequential machine. The hypothesis output by this inference algorithm is a nondeterministic Moore‐type sequential machine which does not

Hybridizing harmony search algorithm wit
Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
✍ M. Fesanghary; M. Mahdavi; M. Minary-Jolandan; Y. Alizadeh πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 779 KB

This study presents a hybrid harmony search algorithm (HHSA) to solve engineering optimization problems with continuous design variables. Although the harmony search algorithm (HSA) has proven its ability of finding near global regions within a reasonable time, it is comparatively inefficient in per