The hardest constraint problems: a double phase transition
Artificial Intelligence
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Exploiting the deep structure of constraint problems
Artificial Intelligence
Empirical methods for artificial intelligence
Empirical methods for artificial intelligence
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
ACM Transactions on Mathematical Software (TOMS)
New methods to color the vertices of a graph
Communications of the ACM
Scaling Effects in the CSP Phase Transition
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
From approximate to optimal solutions: a case study of number partitioning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The constrainedness knife-edge
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Hill climbing algorithms for content-based retrieval of similar configurations
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Heuristic Solution of Open Bin Packing Problems
Journal of Heuristics
An Examination of Probabilistic Value-Ordering Heuristics
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Random Constraint Satisfaction: Theory Meets Practice
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
The Dynamics of Dynamic Variable Ordering Heuristics
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
In Search of a Phase Transition in the AC-Matching Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Phase Transition of the Linear Inequalities Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Graph coloring with quantum heuristics
Eighteenth national conference on Artificial intelligence
Fast Theta-Subsumption with Constraint Satisfaction Algorithms
Machine Learning
When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems
Artificial Intelligence Review
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Learning Horn Expressions with LOGAN-H
The Journal of Machine Learning Research
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics
On the Efficiency of Impact Based Heuristics
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the Integration of Singleton Consistencies and Look-Ahead Heuristics
Recent Advances in Constraints
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
Combining local search and look-ahead for scheduling and constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
Improving search using indexing: a study with temporal CSPs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Fitness-distance correlation and solution-guided multi-point constructive search for CSPs
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Detecting unsatisfiable CSPs by coloring the micro-structure
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Exploiting the deep structure of constraint satisfaction problems with quantum computers
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Clustering at the phase transition
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Is computational complexity a barrier to manipulation?
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Understanding the behavior of Solution-Guided Search for job-shop scheduling
Journal of Scheduling
Limited discrepancy search revisited
Journal of Experimental Algorithmics (JEA)
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
Predicting optimal constraint satisfaction methods
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Logical analysis of hash functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
A hardware relaxation paradigm for solving NP-hard problems
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Challenging heuristics: evolving binary constraint satisfaction problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Predicting good propagation methods for constraint satisfaction
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
A Formalization of Autonomous Dynamic Reconfiguration in Distributed Constraint Satisfaction
Fundamenta Informaticae
Self-control of the time complexity of a constraint satisfaction problem solver program
Journal of Systems and Software
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
We introduce a parameter that measures the "constrainedness" of an ensemble of combinatorial problems. If problems are over-constrained, they are likely to be insoluble. If problems are under-constrained, they are likely to be soluble. This constrainedness parameter generalizes a number of parameters previously used in different NP-complete problem classes. Phase transitions in different NP classes can thus be directly compared. This parameter can also be used in a heuristic to guide search. The heuristic captures the intuition of making the most constrained choice first, since it is often useful to branch into the least constrained subproblem. Many widely disparate heuristics can be seen as minimizing constrainedness.