𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm based on tabu search for satisfiability problem

✍ Scribed by Wenqi Huang; Defu Zhang; Houxiang Wang

Publisher
Springer
Year
2002
Tongue
English
Weight
550 KB
Volume
17
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search-based algorithm for the fu
A tabu search-based algorithm for the fuzzy clustering problem
✍ Khaled S Al-Sultan; Chawki A Fedjki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 597 KB

The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we