Simulated annealing: theory and applications
Simulated annealing: theory and applications
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the hardness of approximate reasoning
Artificial Intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the computational power of PP and (+)P
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
When gravity fails: local search topology
Journal of Artificial Intelligence Research
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Approximate resolution of hard numbering problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Phase Transitions in Relational Learning
Machine Learning
An experimental study of phase transitions in matching
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
In this paper, statistical counting is introduced in the context of stochastic local search. From a sample of trajectories by independent local search computations, it is shown that interesting statistical information can be actually extracted about the search space, most notably an unbiased estimate of the number of solutions. Computational results for random #SAT instances are provided.