Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A genetic local search algorithm for random binary constraint satisfaction problems
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Determining if (FC-) (conflict-directed) back jumping visits a given node is NP-hard
Artificial Intelligence
An Average Analysis of Backtracking on Random Constraint Satisfaction Problems
Annals of Mathematics and Artificial Intelligence
Phase Transitions in Relational Learning
Machine Learning
GA performance distributions and randomly generated binary constraint satisfaction problems
Theoretical Computer Science - Natural computing
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A Meta-heuristic for Subset Problems
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Abstraction and Phase Transitions in Relational Learning
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Random Constraint Satisfaction: Theory Meets Practice
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Relational Learning: Hard Problems and Phase Transitions
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Graph coloring with quantum heuristics
Eighteenth national conference on Artificial intelligence
Experimental complexity analysis of continuous constraint satisfaction problems
Information Sciences: an International Journal
Relational learning as search in a critical region
The Journal of Machine Learning Research
On the average similarity degree between solutions of random k-SAT and random CSPs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Constructive generation of very hard 3-colorability instances
Discrete Applied Mathematics
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Quantum computing and phase transitions in combinatorial search
Journal of Artificial Intelligence Research
A new look at the easy-hard-easy pattern of combinatorial search difficulty
Journal of Artificial Intelligence Research
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
Solving highly constrained search problems with quantum computers
Journal of Artificial Intelligence Research
An experimental study of phase transitions in matching
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Theoretical analysis of Davis-Putnam procedure and propositional satisfiability
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Learning on the phase transition edge
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
Automatically generating personalized user interfaces with Supple
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
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Exploiting a theory of phase transitions in three-satisfiability problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
The very particular structure of the very hard instances
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
| Hi-index | 0.00 |