Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Solutions calculated by Evolutionary Algorithms have come to surpass exact methods for solving various problems. The Rubik’s Cube multiobjective optimization problem is one such ...
Two notions of optimality have been explored in previous work on hierarchical reinforcement learning (HRL): hierarchical optimality, or the optimal policy in the space defined by ...
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...