**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**6

# Search results for: Approximate algorithm

##### 6 Fuzzy Population-Based Meta-Heuristic Approaches for Attribute Reduction in Rough Set Theory

**Authors:**
Mafarja Majdi,
Salwani Abdullah,
Najmeh S. Jaddi

**Abstract:**

**Keywords:**
Rough Set Theory,
Attribute Reduction,
Fuzzy
Logic,
Memetic Algorithms,
Record to Record Algorithm,
Great
Deluge Algorithm.

##### 5 Optimization Using Simulation of the Vehicle Routing Problem

**Authors:**
Nayera E. El-Gharably,
Khaled S. El-Kilany,
Aziz E. El-Sayed

**Abstract:**

**Keywords:**
Discrete event system simulation,
optimization using simulation,
vehicle routing problem.

##### 4 A Special Algorithm to Approximate the Square Root of Positive Integer

**Authors:**
Hsian Ming Goo

**Abstract:**

The paper concerns a special approximate algorithm of the square root of the specific positive integer, which is built by the use of the property of positive integer solution of the Pell’s equation, together with using some elementary theorems of matrices, and then takes it to compare with general used the Newton’s method and give a practical numerical example and error analysis; it is unexpected to find its special property: the significant figure of the approximation value of the square root of positive integer will increase one digit by one. It is well useful in some occasions.

**Keywords:**
Special approximate algorithm,
square root,
Pell’s
equation,
Newton’s method,
error analysis.

##### 3 Constructing a Simple Polygonalizations

**Authors:**
V. Tereshchenko,
V. Muravitskiy

**Abstract:**

**Keywords:**
simple polygon,
approximate algorithm,
minimal
area polygon,
polygonalizations

##### 2 A Hybridization of Constructive Beam Search with Local Search for Far From Most Strings Problem

**Authors:**
Sayyed R Mousavi

**Abstract:**

The Far From Most Strings Problem (FFMSP) is to obtain a string which is far from as many as possible of a given set of strings. All the input and the output strings are of the same length, and two strings are said to be far if their hamming distance is greater than or equal to a given positive integer. FFMSP belongs to the class of sequences consensus problems which have applications in molecular biology. The problem is NP-hard; it does not admit a constant-ratio approximation either, unless P = NP. Therefore, in addition to exact and approximate algorithms, (meta)heuristic algorithms have been proposed for the problem in recent years. On the other hand, in the recent years, hybrid algorithms have been proposed and successfully used for many hard problems in a variety of domains. In this paper, a new metaheuristic algorithm, called Constructive Beam and Local Search (CBLS), is investigated for the problem, which is a hybridization of constructive beam search and local search algorithms. More specifically, the proposed algorithm consists of two phases, the first phase is to obtain several candidate solutions via the constructive beam search and the second phase is to apply local search to the candidate solutions obtained by the first phase. The best solution found is returned as the final solution to the problem. The proposed algorithm is also similar to memetic algorithms in the sense that both use local search to further improve individual solutions. The CBLS algorithm is compared with the most recent published algorithm for the problem, GRASP, with significantly positive results; the improvement is by order of magnitudes in most cases.

**Keywords:**
Bioinformatics,
Far From Most Strings Problem,
Hybrid metaheuristics,
Matheuristics,
Sequences consensus problems.

##### 1 Approximate Frequent Pattern Discovery Over Data Stream

**Authors:**
Kittisak Kerdprasop,
Nittaya Kerdprasop

**Abstract:**

**Keywords:**
Frequent pattern discovery,
Approximate algorithm,
Data stream analysis.