Login / Signup
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.
Michael R. Fellows
Bart M. P. Jansen
Published in:
ACM Trans. Comput. Theory (2014)
Keyphrases
</>
significant improvement
times faster
reinforcement learning
computational complexity
computationally efficient
computational efficiency
recently developed
genetic algorithm
multiscale
objective function
data structure
computational cost
optimization problems
orders of magnitude