Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
Performance of linear-space search algorithms
Artificial Intelligence
Artificial Intelligence
Constructive bounds and exact expectation for the random assignment problem
Random Structures & Algorithms
The probabilistic relationship between the assignment and asymmetric traveling salesman problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Phase transition and finite-size scaling for the integer partitioning problem
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Backbones in optimization and approximation
IJCAI'01 Proceedings of the 17th 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
How autonomy oriented computing (AOC) tackles a computationally hard optimization problem
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Phase transitions and backbones of the asymmetric traveling salesman problem
Journal of Artificial Intelligence Research
Iterative patching and the asymmetric traveling salesman problem
Discrete Optimization
Hi-index | 0.00 |
Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is closely tied to how accurately data values are predicted at runtime. Caching ...