Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Random 3-SAT: The Plot Thickens
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Random 3-SAT and BDDs: The Plot Thickens Further
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Comparing phase transitions and peak cost in PP-complete satisfiability problems
Eighteenth national conference on Artificial intelligence
Trade of a problem-solving task
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Experimental complexity analysis of continuous constraint satisfaction problems
Information Sciences: an International Journal
Random 3-SAT: The Plot Thickens
Constraints
Annals of Mathematics and Artificial Intelligence
Constructive generation of very hard 3-colorability instances
Discrete Applied Mathematics
A Model to Study Phase Transition and Plateaus in Relational Learning
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
A generative power-law search tree model
Computers and Operations Research
Empirical Study of Relational Learning Algorithms in the Phase Transition Framework
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
On balanced CSPs with high treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Backbone fragility and the local search cost peak
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
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
Solving highly constrained search problems with quantum computers
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Stochastic search and phase transitions: AI meets physics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Algorithmic entropy, phase transition, and smart systems
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Analysis of phase transitions in graph-coloring problems based on constraint structures
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Summarizing CSP hardness with continuous probability distributions
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
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
Impact of censored sampling on the performance of restart strategies
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Using hajós' construction to generate hard graph 3-colorability instances
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Self-control of the time complexity of a constraint satisfaction problem solver program
Journal of Systems and Software
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
Hi-index | 0.00 |