A novel non-heuristic search technique for constructing uniform designs with a mixture of two- and four-level factors: a simple industrial applicable approach

2022 ◽  
Author(s):  
A. M. Elsawah
Keyword(s):  
Heuristic Search ◽  
Search Technique ◽  
Uniform Designs

MDABC

2012 ◽  
Vol 5 (4) ◽  
pp. 30-47
Author(s):  
Vikas Singh ◽  
Deepak Singh ◽  
Ritu Tiwari ◽  
Anupam Shukla
Keyword(s):  
Heuristic Search ◽  
Motif Discovery ◽  
Optimization Problem ◽  
Homo Sapiens ◽  
Population Based ◽  
Superior Performance ◽  
Sequential Algorithm ◽  
Search Technique ◽  
Bee Colony ◽  
Human And Mouse

Motif discovery is one of the most popular problems in molecular biology. There are many solutions provided by researchers. In this paper we have adopted the features of the Artificial beecolony algorithm (ABC) and designed a sequential algorithm to solve motif problem and named it MDABC. Artificial bee colony algorithm is a population based heuristic search technique used for optimization problem. We have performed experiments with the nucleotide sequences of homo sapiens (human) and mouse viz. CDRT4, MACF1, Zfa, TNFRSF19 and TICAM2. The ABC algorithm applied to the CDRT4, MACF1, Zfa, TNFRSF19 and TICAM2 DNA sequence for determining the motif of length 10, 20 and 30 using the maximum number of cycle (MCN) or the maximum number of generation is equal to 250, 500 and 1000. Our result shows a promising superior performance of the algorithm. As we will see, our results surpass the results obtained by other approaches proposed in the literature.

scholarly journals Exploring a Flexible Scoring Scheme for a Heuristic Search Technique: A Case Study of University Timetables

2020 ◽  
Vol 16 (5) ◽  
pp. 660-670
Author(s):  
Sangsuree Vasupongayya ◽  
Warakorn Sitthirit ◽  
Suthon Sae-Wong ◽  
Thaniya Kaosol
Keyword(s):  
Heuristic Search ◽  
Search Technique

Cognitive Route Search Technique for Self-Driving Vehicles

2018 ◽  
Vol 12 (1) ◽  
pp. 29-41 ◽  
Author(s):  
Hironori Hiraishi ◽  
Fumio Mizoguchi
Keyword(s):  
Cognitive Psychology ◽  
Prospect Theory ◽  
Heuristic Search ◽  
Search Method ◽  
Time Limit ◽  
Search Technique ◽  
Initial Portion ◽  
Cognitive Aspect ◽  
Route Search

This article introduces Time-Constrained Heuristic Search (TCS) as a route search technique that incorporates a cognitive aspect in self-driving vehicles. TCS is a search method using which we can set the time limit to generate a route in advance. The most important feature of TCS is that the node expansion in the latter portion of the journey near the destination tends to be minimized to ensure that the search finishes within the prescribed time limit. TCS conducts a search during the initial portion of the journey that is related to the route the vehicle will move on in the immediate future, but does not take into account the latter portion of the route to a great extent. So, TCS can be regarded as the search technique that selects an option to generate immediate benefit. This characteristic is well-known as the present-oriented bias or the prospect theory in cognitive psychology. Hence, the authors can infer that TCS provides an ability of cognitive judgment to self-driving vehicles.

Sign in / Sign up

Export Citation Format

Share Document