A faster algorithm for the construction of optimal factoring automata.
Thomas ErlebachKleitos PapadopoulosPublished in: CoRR (2024)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- experimental evaluation
- learning algorithm
- times faster
- closed form
- detection algorithm
- computationally efficient
- globally optimal
- optimization algorithm
- computational cost
- preprocessing
- cost function
- operating point
- memory efficient
- optimal parameters
- highly efficient
- computational complexity
- k means
- np hard
- shortest path
- cellular automata
- matching algorithm
- search space
- segmentation algorithm
- exhaustive search
- objective function
- neural network
- multi objective
- computationally demanding