A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities.
Pierre HansenBrigitte JaumardMichel MinouxPublished in: Math. Program. (1986)
Keyphrases
- learning algorithm
- k means
- boolean expressions
- detection algorithm
- linear programming
- linear inequalities
- linear complexity
- decomposition algorithm
- initial set
- image set
- input data
- computational cost
- preprocessing
- search space
- probabilistic model
- worst case
- optimal solution
- dynamic programming
- particle swarm optimization
- optimization algorithm
- convex hull
- genetic algorithm
- bayesian networks
- computational complexity
- recognition algorithm
- solution space
- convergence rate
- ant colony optimization
- np hard
- segmentation algorithm
- neural network
- simulated annealing
- feature set