March 27, 2019 / / in cs updates on arXiv.org / with No comments /
We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver. Our experimental results demonstrate that this approach gives satisfactory results for automata with up to 100 states even if very modest computational resources are used.
From Gameplay to Symbolic Reasoning: Learning SAT Solver Heuristics in the Style of Alpha(Go) Zero. (arXiv:1802.05340v1 [cs.AI])Distributed Stochastic Optimization via Adaptive Stochastic Gradient Descent. (arXiv:1802.05811v1 [stat.ML])End-to-end Analysis and Design of a Drone Flight Controller. (arXiv:1802.05802v1 [cs.SY])Variational Autoencoders for Collaborative Filtering. (arXiv:1802.05814v1 [stat.ML])MPC-Inspired Neural Network Policies for Sequential Decision Making. (arXiv:1802.05803v1 [cs.LG])
0 comments:
Post a Comment