16 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.AI2022
AlphaSnake: Policy Iteration on a Nondeterministic NP-hard Markov Decision Process
Kevin Du, Ian Gemp, Yi Wu +1
Reinforcement learning has recently been used to approach well-known NP-hard combinatorial problems in graph theory. Among these problems, Hamiltonian cycle problems are exceptiona…
cs.AI2015★ 16 cited
Tractability and Decompositions of Global Cost Functions
David Allouche, Christian Bessiere, Patrice Boizumault +8
Enforcing local consistencies in cost function networks is performed by applying so-called Equivalent Preserving Transformations (EPTs) to the cost functions. As EPTs transform the…