A Memory Efficient Variant of an Implementation of the F _4 Algorithm for Computing Gröbner Bases.
Yun-Ju HuangWei-Chih HongChen-Mou ChengJiun-Ming ChenBo-Yin YangPublished in: INTRUST (2014)
Keyphrases
- memory efficient
- k means
- detection algorithm
- computational cost
- learning algorithm
- external memory
- optimal solution
- computational efficiency
- np hard
- optimization algorithm
- neural network
- worst case
- probabilistic model
- hardware implementation
- matching algorithm
- segmentation algorithm
- particle swarm optimization
- dynamic programming
- significant improvement
- search space
- simulated annealing
- cost function
- preprocessing
- parallel implementation
- search algorithm
- objective function
- iterative deepening