How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorica
The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Sample complexity of model-based search
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Go with the winners for graph bisection
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hill-climbing finds random planted bisections
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Go with the Winners Algorithms for Cliques in Random Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
ILS-perturbation based on local optima structure for the QAP problem
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Multi-objective go with the winners algorithm: a preliminary study
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
| Hi-index | 0.00 |