CAFO: Cost aware flip optimization for asymmetric memories

R Maddah, SM Seyedzadeh… - 2015 IEEE 21st …, 2015 - ieeexplore.ieee.org
Phase Change Memory (PCM) and spin-transfer torque random access memory (STT-RAM)
are emerging as new memory technologies to replace DRAM and NAND flash that are …

An analysis of single-player Monte Carlo tree search performance in sokoban

M Crippa, PL Lanzi, F Marocchi - Expert Systems with Applications, 2022 - Elsevier
We apply the extension of Monte Carlo Tree Search for single player games (SP-MCTS) to
Sokoban and compare its performance to a solver integrating Iterative Deepening A*(IDA*) …

Genetic algorithms with local optima handling to solve sudoku puzzles

F Gerges, G Zouein, D Azar - … of the 2018 international conference on …, 2018 - dl.acm.org
Sudoku is a popular combinatorial number puzzle game and is widely spread on online
blogs and in newspapers worldwide. However, the game is very complex in nature and …

β-hill climbing algorithm for sudoku game

MA Al-Betar, MA Awadallah, AL Bolaji… - … on Information and …, 2017 - ieeexplore.ieee.org
In this paper, β-Hill Climbing algorithm, the recent local search-based meta-heuristic, are
tailored for Sudoku puzzle. β-Hill Climbing algorithm is a new extended version of hill …

Solving Sudoku With Ant Colony Optimization

H Lloyd, M Amos - IEEE Transactions on Games, 2019 - ieeexplore.ieee.org
In this article, we present a new algorithm for the well-known and computationally
challenging Sudoku puzzle game. Our ant-colony-optimization-based method significantly …

Ferex: A reconfigurable design of multi-bit ferroelectric compute-in-memory for nearest neighbor search

Z Xu, CK Liu, C Li, R Mao, J Yang… - … , Automation & Test …, 2024 - ieeexplore.ieee.org
Rapid advancements in artificial intelligence have given rise to transformative models,
profoundly impacting our lives. These models demand massive volumes of data to operate …

A hybrid approach for the sudoku problem: Using constraint programming in iterated local search

N Musliu, F Winter - IEEE Intelligent Systems, 2017 - ieeexplore.ieee.org
Sudoku is not only a popular puzzle but also an interesting and challenging constraint
satisfaction problem. Therefore, automatic solving methods have been the subject of several …

Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms

R Soto, B Crawford, A Munoz, F Johnson… - … : Proceedings of the 4th …, 2015 - Springer
The Electromagnetism-like algorithm is a relatively modern metaheuristic based on the
attraction-repulsion mechanism of particles in the context of electromagnetism theory. This …

A prefiltered cuckoo search algorithm with geometric operators for solving Sudoku problems

R Soto, B Crawford, C Galleguillos… - The Scientific World …, 2014 - Wiley Online Library
The Sudoku is a famous logic‐placement game, originally popularized in Japan and today
widely employed as pastime and as testbed for search algorithms. The classic Sudoku …

Using autonomous search for solving constraint satisfaction problems via new modern approaches

R Soto, B Crawford, R Olivares, C Galleguillos… - Swarm and Evolutionary …, 2016 - Elsevier
Constraint Programming is a powerful paradigm which allows the resolution of many
complex problems, such as scheduling, planning, and configuration. These problems are …