Extension of Brickell's Algorithm for Breaking High Density Knapsacks.
F. JorissenJoos VandewalleRené GovaertsPublished in: EUROCRYPT (1987)
Keyphrases
- high density
- dynamic programming
- learning algorithm
- detection algorithm
- optimization algorithm
- preprocessing
- k means
- computational cost
- matching algorithm
- theoretical analysis
- knapsack problem
- high accuracy
- worst case
- experimental evaluation
- np hard
- cost function
- optimal solution
- objective function
- database
- probabilistic model
- search space
- expectation maximization
- recognition algorithm
- low density
- data sources
- times faster
- simulated annealing
- significant improvement
- computational complexity
- neural network