P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-91), pages 331--337, 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Martin Pelikan, Kumara Sastry, Martin V. Butz, and David E.. - Medal Report No (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-91), pages 331--337, 1991.
RRT-blossom: RRT with a local flood-fill behavior - Maciej Kalisiak Dept (2006) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. M. Taylor, "Where the really hard problems are," in Proc. of the 12th Int. Joint Conf. on Artificial Intelligence, 1991, pp. 331--337. [Online]. Available: citeseer.ist.psu.edu/cheeseman91where.html
An Experimental Study on the Complexity of Left-Deep.. - König-Ries, Helmer.. (1995) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Int. Joint Conf. on Artificial Intelligence, pages 331--337, 1991.
Comparing Three Approaches to Large-Scale Coordination - Scerri, Vincent, Mailler (2004) (1 citation) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91), pages 331--337, 1991.
Linking Search Space Structure, Run-Time Dynamics, and.. - Watson, Whitley, Howe (2004) (Correct)
No context found.
Cheeseman, P., Kanefsky, B., & Taylor, W. (1991). Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), pp. 331--337.
Hiding Satisfying Assignments: Two are Better than One - Achlioptas, Jia, Moore (Correct)
No context found.
P. Cheeseman, R. Kanefsky, and W. Taylor, Where the really hard problems are, IJCAI (1991), 163--169.
The Threshold for Random k-SAT is 2^k log 2 - O(k) - Achlioptas, Peres (2004) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proc. 12th International Joint Conference on Artificial Intelligence (IJCAI-91) Vol. 1, pages 331--337, 1991.
Experiments with Local Search on Random 2+p-SAT - Singer, Gent, Smaill (2000) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. Taylor. Where the Really Hard Problems Are. In Proceedings of IJCAI-91, pages 331-340. Morgan Kaufmann, 1991.
Phase Transitions and Stochastic Local Search in k-Term.. - Rückert, Kramer, De Raedt (Correct)
No context found.
Cheeseman, P., Kanefsky, B., and Taylor, W. M. (1991). Where the really hard problems are. Proceedings of the 12th IJCAI, 331-337
A SAT-Based Decision Procedure for ALC - Giunchiglia, Sebastiani (1996) (30 citations) (Correct)
No context found.
P. Cheeseman, B. Kanefski, and W. M. Taylor. Where the really hard problem are. In Proc. of the 12th International Joint Conference on Artificial Intelligence, pages 163--169, 1991.
Backbones in Optimization and Approximation - John Slaney Automated (2001) (11 citations) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proc. of the 12th IJCAI, pages 331--337. 1991.
Ordinal Constraint Satisfaction - Eugene Freuder Richard (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings, 12th Int. Jt. Conf. on AI, pages 331--337, San Mateo, CA, 1991. Morgan Kaufmann.
Towards Automated Reformulation of Specifications - Mancini (Correct)
No context found.
P. Cheeseman, B. Kanefski, and W. M. Taylor. Where the really hard problem are. In Proc. of IJCAI'91, pages 163--169, 1991.
On the Complexity of Distributed Self-Configuration in.. - Krishnamachari, Al. (2003) (2 citations) (Correct)
No context found.
P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proc. of IJCAI-91, Vol. 1, 1991, pp. 331--337.
Representation and Reasoning with Non-Binary Constraints - Stergiou (2001) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of IJCAI-91, volume 1, pages 331-337, 1991.
A Shot in the Dark - Owen (2003) (Correct)
No context found.
P. Cheeseman, B. Kanesfy, and W. Taylor. Where the Really Hard Problems Are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 1991.
Dynamic Detection and Exploitation of Value Symmetries for.. - Lal, Choueiry (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the Really Hard Problems Are. IJCAI-91, pages 331-337, 1991.
Forward Checking with Backmarking - June Patrick Prosser (1995) (13 citations) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are. Proc IJCAI-91 331-337
An Empirical Study of the Stable Marriage Problem with - Ties And Incomplete (2002) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W Taylor, `Where the really hard problems are', in Proceedings IJCAI'91, pp. 331--337, (1991).
Annals of Mathematics and Artificial Intelligence 28.. - Compute-Intensive.. (Correct)
No context found.
P. Cheeseman, B. Kanefsky, M. Taylor and M. William, Where the really hard problems are, in: Proc. IJCAI-91 (1991) pp. 331--336.
Understanding Random SAT: Beyond the.. - Nudelman, Devkar.. (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the Really Hard Problems Are. In IJCAI-91, 1991.
Probabilistic Methods in Landscape Analysis: Phase.. - Gao, Culberson (Correct)
No context found.
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, Morgan Kaufmann (1991) 331--337
Tuomas W. Sandholm and Victor R. Lesser - Computer Science Department (1994) (Correct)
No context found.
Cheeseman, P., Kanefsky, B., and Taylor, W. 1991. Where the Really Hard Problems Are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pp. 331-337.
Learning the Empirical Hardness of Optimization.. - Leyton-Brown.. (2002) (2 citations) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the Really Hard Problems Are. In IJCAI-91, 1991.
An Empirical Study of the Stable Marriage Problem with Ties.. - Gent, Prosser (2002) (1 citation) (Correct)
No context found.
P. Cheeseman, B. Kanefsky, and W Taylor, `Where the really hard problems are', in Proceedings IJCAI'91, pp. 331--337, (1991).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC