An order out of nowhere: a new algorithm for infinite-domain CSPs.
Antoine MottetMichael PinskerTomás NagyPublished in: CoRR (2023)
Keyphrases
- learning algorithm
- optimal solution
- improved algorithm
- optimization algorithm
- computational complexity
- experimental evaluation
- cost function
- high accuracy
- significant improvement
- recognition algorithm
- dynamic programming
- search space
- times faster
- detection algorithm
- preprocessing
- segmentation algorithm
- constraint satisfaction problems
- worst case
- non binary
- path consistency
- theoretical analysis
- linear programming
- computational cost
- np hard
- decision trees
- particle swarm optimization
- domain specific
- probabilistic model
- k means
- similarity measure