A new approach to speed up combinatorial search strategies using stack and hash table

• Owing to the significance of combinatorial search strategies both for academia and industry, the introduction of new techniques is a fast growing research field these days. These strategies have really taken different forms ranging from simple to complex strategies in order to solve all forms of combinatorial problems. Nonetheless, despite the kind of problem these approaches solve, they are prone to heavy computation with the number of combinations and growing search space dimensions. This paper presents a new approach to speed up the generation and search processes using a combination of stack and hash table data structures. This approach could be put to practice for the combinatorial approaches to speed up the generation of combinations and search process in the search space. Furthermore, this new approach proved its performance in diverse stages better than other known strategies. © 2016 IEEE.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Combinatorial interaction testing

Combinatorial optimisation

Combinatorial search

Covering array

Combinatorial optimization

Combinatorial approach

Combinatorial problem

Covering arrays

New approaches

Research fields

Search space dimension

Data structures

Computer Science

Datavetenskap

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)