On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem.
Alexander V. SeliverstovPublished in: CSR (2017)
Keyphrases
- dynamic programming
- randomly generated
- initial set
- probabilistic model
- lower and upper bounds
- computational complexity
- decomposition algorithm
- np hard
- preprocessing
- solution space
- learning algorithm
- cost function
- similarity measure
- search space
- optimization algorithm
- detection algorithm
- context free parsing
- posterior probability
- boolean expressions
- disjoint subsets
- partial solutions
- gradient projection
- exact solution
- segmentation algorithm
- image set
- combinatorial optimization
- graph cuts
- input data
- linear programming
- k means
- lower bound
- search algorithm
- objective function
- decision trees