Proposing a new search template for modelling languages | Zendy

Reza Rafeh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Proposing a new search template for modelling languages

Author(s) -

Reza Rafeh

Publication year - 2011

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2011.01.037

Subject(s) - computer science , beam search , combinatorial search , guided local search , search algorithm , incremental heuristic search , space (punctuation) , best first search , iterative deepening depth first search , local search (optimization) , theoretical computer science , search problem , tree (set theory) , artificial intelligence , algorithm , mathematics , mathematical analysis , operating system

The major problem in solving combinatorial optimization problems is the huge size of the search space. To explore the search space in a reasonable time, using smart search algorithms is inevitable. One of the main difficulties in implementing search methods is the lack of a uniform, high-level template for all search paradigms. In this paper, we propose a high-level, parametric template suitable for modeling languages which covers both tree search and local search

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research