ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Heuristics: intelligent search strategies for computer problem solving
  Purchase this Book  
Source Addison-Wesley Longman Publishing Co., Inc.   Boston, MA, USA
Pages: 382  
Year of Publication: 1984
ISBN:0-201-05594-5
Author
Judea Pearl  University of California, Los Angeles, CA
Publisher
Addison-Wesley Longman Publishing Co., Inc.  Boston, MA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 206
Additional Information:

cited by   index terms   review   collaborative colleagues  

Tools and Actions: Review this Book  

CITED BY  206
Toru Ishida, Real-Time Search for Autonomous Agents and Multiagent Systems, Autonomous Agents and Multi-Agent Systems, v.1 n.2, p.139-167, October 1998
Lane B. Warshaw , Daniel P. Miranker, Rule-based query optimization, revisited, Proceedings of the eighth international conference on Information and knowledge management, p.267-275, November 02-06, 1999, Kansas City, Missouri, United States
G. Karypis , V. Kumar, Unstructured tree search on SIMD parallel computers: a summary of results, Proceedings of the 1992 ACM/IEEE conference on Supercomputing, p.453-462, November 16-20, 1992, Minneapolis, Minnesota, United States
Harold W. Martin, Polynomial evaluations of bi-valued game trees, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.319-326, February 1986, Cincinnati, Ohio, United States
Keqin Li, Performance evaluation of probabilistic tree embedding in cube-connected cycles, Proceedings of the 1998 ACM symposium on Applied Computing, p.584-592, February 27-March 01, 1998, Atlanta, Georgia, United States
Richard H. Lathrop, An anytime algorithm for gapped block protein threading with pair interactions, Proceedings of the third annual international conference on Computational molecular biology, p.238-249, April 11-14, 1999, Lyon, France
James J. Grimm , Gary B. Lamont , Andrew J. Terzuoli, A parallelized search strategy for solving a multicriteria aircraft routing problem, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.570-577, February 14-16, 1993, Indianapolis, Indiana, United States
A. Bagchi , Anup K. Sen, Heuristic search in general tree structures: an average case analysis, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.309-318, February 1986, Cincinnati, Ohio, United States
Andrew Sohn , Mitsuhisa Sato , Shuichi Sakai , Yuetsu Kodama , Yoshinori Yamaguchi, Nonnumeric search results on the EM-4 distributed-memory multiprocessor, Proceedings of the 1994 conference on Supercomputing, p.301-310, December 1994, Washington, D.C., United States
Shlomit Weiss , Ilan Spillinger , Gabriel M. Siberman, Architectural improvements for data-driven VLSI processing arrays, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.243-259, September 11-13, 1989, Imperial College, London, United Kingdom
Michael S. Gudaitis , Gary B. Lamont , Andrew J. Terzuoli, Multicriteria vehicle route-planning using parallel A * search, Proceedings of the 1995 ACM symposium on Applied computing, p.171-176, February 26-28, 1995, Nashville, Tennessee, United States
Keqin Li, On dynamic tree growing in hypercubes, Proceedings of the 1997 ACM symposium on Applied computing, p.496-503, April 1997, San Jose, California, United States
Bruce Abramson, Control strategies for two-player games, ACM Computing Surveys (CSUR), v.21 n.2, p.137-161, Jun. 1989
Yaron Shoham , Sivan Toledo, Parallel randomized best-first minimax search, Artificial Intelligence, v.137 n.1-2, p.165-196, May 2002
Marti A. Hearst, Information Integration, IEEE Intelligent Systems, v.13 n.5, p.12-24, September 1998
A. J. W. M. ten Berg, Flexible controlpath microarchitecture synthesis based on artificial intelligence, Proceedings of the conference on European design automation, p.112-117, November 1992, Congress Centrum Hamburg, Hamburg, Germany
Harold W. Martin , Terrance L. Seethoff, On optimal algorithms for solving bi-valued game trees, Proceedings of the 15th annual conference on Computer Science, p.254-260, February 1987, St. Louis, Missouri, United States
Rina Dechter , Daniel Frost, Backjump-based backtracking for constraint satisfaction problems, Artificial Intelligence, v.136 n.2, p.147-188, April 2002
William W. Cohen, Data integration using similarity joins and a word-based information representation language, ACM Transactions on Information Systems (TOIS), v.18 n.3, p.288-321, July 2000
Ming-Yang Kao , Yuan Ma , Michael Sipser , Yiqun Yin, Optimal constructions of hybrid algorithms, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.372-381, January 23-25, 1994, Arlington, Virginia, United States
Thomas Sudkamp , Robert Shanahan, Analysis of heurisitc search models, Proceedings of the 15th annual conference on Computer Science, p.7-15, February 1987, St. Louis, Missouri, United States
Ranier Feldmann , Peter Mysliwiete , Burkhard Monien, Studying overheads in massively parallel MIN/MAX-tree evaluation, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.94-103, June 27-29, 1994, Cape May, New Jersey, United States
Rina Dechter , Judea Pearl, Generalized best-first search strategies and the optimality af A*, Journal of the ACM (JACM), v.32 n.3, p.505-536, July 1985
Paul Suetens , Pascal Fua , Andrew J. Hanson, Computational strategies for object recognition, ACM Computing Surveys (CSUR), v.24 n.1, p.5-62, March 1992
P. P. Chakrabarti , S. Ghose , S. C. DeSarkar, Best first search in and/or graphs, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.256-261, February 1988, Atlanta, Georgia, United States
Hong Liu , Aaron Kershenbaum , Richard Van Slyke, Artificial intelligence applications to communication network design with bulk facilities, Proceedings of the 1992 ACM annual conference on Communications, p.345-350, March 03-05, 1992, Kansas City, Missouri, United States
Bradley S. Stewart , Chelsea C. White, III, Multiobjective A*, Journal of the ACM (JACM), v.38 n.4, p.775-814, Oct. 1991
A. Reyes , H. Yu , G. Kelleher , S. Lloyd, Integrating Petri nets and hybrid heuristic search for the scheduling of FMS, Computers in Industry, v.47 n.1, p.123-138, January 2002
Weixiong Zhang, Search techniques, Handbook of data mining and knowledge discovery, Oxford University Press, Inc., New York, NY, 2002
Ehud Kalai, Games, computers, and O.R., Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.468-473, January 28-30, 1996, Atlanta, Georgia, United States
Patrice Perny , Olivier Spanjaard, On preference-based search in state space graphs, Eighteenth national conference on Artificial intelligence, p.751-756, July 28-August 01, 2002, Edmonton, Alberta, Canada
A. Choi , M. Ruschitzka, Managing Locality Sets: The Model and Fixed-Size Buffers, IEEE Transactions on Computers, v.42 n.2, p.190-204, February 1993
F. J. Lin , P. M. Chu , M. T. Liu, Protocol verification using reachability analysis: the state space explosion problem and relief strategies, ACM SIGCOMM Computer Communication Review, v.17 n.5, p.126-135, Oct./Nov. 1987
Ming-Yang Kao , John H. Reif , Stephen R. Tate, Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.441-447, January 25-27, 1993, Austin, Texas, United States
Keqin Li, Maintenance of tree structured computations on parallel and distributed computer systems, Proceedings of the 1996 ACM symposium on Applied Computing, p.337-343, February 17-19, 1996, Philadelphia, Pennsylvania, United States
Andrew Sohn , Mitsuhisa Sato , Shuichi Sakai , Yuetsu Kodama , Yoshinori Yamaguchi, Nonnumeric search results on the EM-4 distributed-memory multiprocessor, Proceedings of the 1994 ACM/IEEE conference on Supercomputing, November 14-18, 1994, Washington, D.C.
Anup K. Sen , Amitava Bagchi , Weixiong Zhang, An average-case analysis of graph search, Eighteenth national conference on Artificial intelligence, p.757-762, July 28-August 01, 2002, Edmonton, Alberta, Canada
P. Dasgupta , P. P. Chakrabarti , A. Dey , S. Ghose , W. Bibel, Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques, IEEE Transactions on Knowledge and Data Engineering, v.14 n.2, p.353-368, March 2002
Toru Ishida , Richard E. Korf, Moving-Target Search: A Real-Time Search for Changing Goals, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.6, p.609-619, June 1995
Yaxin Liu , Sven Koenig , David Furcy, Speeding up the calculation of heuristics for heuristic search-based planning, Eighteenth national conference on Artificial intelligence, p.484-491, July 28-August 01, 2002, Edmonton, Alberta, Canada
Gaia Nicosia , Gianpaolo Oriolo, An approximate A* algorithm and its application to the SCS problem, Theoretical Computer Science, v.290 n.3, p.2021-2029, 3 January 2003
Rune M. Jensen , Randal E. Bryant , Manuela M. Veloso, SetA*: an efficient BDD-based heuristic search algorithm, Eighteenth national conference on Artificial intelligence, p.668-673, July 28-August 01, 2002, Edmonton, Alberta, Canada
Sven Koenig , Maxim Likhachev, D*lite, Eighteenth national conference on Artificial intelligence, p.476-483, July 28-August 01, 2002, Edmonton, Alberta, Canada
Haim (Shvaytser) Schweitzer, Occam Algorithms for Computing Visual Motion, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.11, p.1033-1042, November 1995
Eric K. Jones , Aaron Roydhouse, Intelligent Retrieval of Archived Meteorological Data, IEEE Expert: Intelligent Systems and Their Applications, v.10 n.6, p.50-57, December 1995
Sven Koenig , Craig Tovey , Yuri Smirnov, Performance bounds for planning in unknown terrain, Artificial Intelligence, v.147 n.1-2, p.253-279, July 2003
Jianzhuang Liu , Yong Tsui Lee, A Graph-Based Method for Face Identification from a Single 2D Line Drawing, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.23 n.10, p.1106-1119, October 2001
Piero Fraternali , Stefano Paraboschi, Ordering and Selecting Production Rules for Constraint Maintenance: Complexity and Heuristic Solution, IEEE Transactions on Knowledge and Data Engineering, v.9 n.1, p.173-178, January 1997
A. Reinefeld , T. A. Marsland, Enhanced Iterative-Deepening Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.7, p.701-710, July 1994
Christopher Raphael, Coarse-to-Fine Dynamic Programming, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.23 n.12, p.1379-1390, December 2001
B. W. Wah, Population-Based Learning: A Method for Learning from Examples Under Resource Constraints, IEEE Transactions on Knowledge and Data Engineering, v.4 n.5, p.454-474, October 1992
G. Karypis , V. Kumar, Unstructured Tree Search on SIMD Parallel Computers, IEEE Transactions on Parallel and Distributed Systems, v.5 n.10, p.1057-1072, October 1994
Richard M. Karp , Yangun Zhang, On parallel evaluation of game trees, Journal of the ACM (JACM), v.45 n.6, p.1050-1075, Nov. 1998
Benjamin W. Wah , Arthur Ieumwananonthachai , Lon-Chan Chu , Akiko N. Aizawa, Genetics-Based Learning of New Heuristics: Rational Scheduling of Experiments and Generalization, IEEE Transactions on Knowledge and Data Engineering, v.7 n.5, p.763-785, October 1995
Harish Kriplani , Farid Najm , Ping Yang , Ibrahim Hajj, Resolving signal correlations for estimating maximum currents in CMOS combinational circuits, Proceedings of the 30th international conference on Design automation, p.384-388, June 14-18, 1993, Dallas, Texas, United States
M. Young , R. M. Taylor, Combining Static Concurrency Analysis with Symbolic Execution, IEEE Transactions on Software Engineering, v.14 n.10, p.1499-1511, October 1988
Peter Becker, A new algorithm for the construction of optimal B-trees, Nordic Journal of Computing, v.1 n.4, p.389-401, Winter 1994
Peter D. Holmes , Erland R. A. Jungert, Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.14 n.5, p.549-565, May 1992
H. Yu , A. Reyes , S. Cang , S. Lloyd, Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems-part II: heuristic hybrid search, Computers and Industrial Engineering, v.44 n.4, p.545-566, April 2003
Ozgur Sinanoglu , Alex Orailoglu, Fast and energy-frugal deterministic test through efficient compression and compaction techniques, Journal of Systems Architecture: the EUROMICRO Journal, v.50 n.5, p.257-266, April 2004
Aubrey B. Poore , Alexander J. Robertson, III, A New Lagrangian Relaxation Based Algorithm for a Class ofMultidimensional Assignment Problems, Computational Optimization and Applications, v.8 n.2, p.129-150, Sept 1997
C.-F. Yu , B. W. Wah, Efficient Branch-and-Bound Algorithms on a Two-Level Memory System, IEEE Transactions on Software Engineering, v.14 n.9, p.1342-1356, September 1988
Sungwon Jung , Sakti Pramanik, An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps, IEEE Transactions on Knowledge and Data Engineering, v.14 n.5, p.1029-1046, September 2002
Keqin Li, On the performance of randomized embedding of reproduction trees in static networks, International Journal of Parallel Programming, v.31 n.5, p.393-406, October 2003
Anup K. Sen , Amitava Bagchi , Weixiong Zhang, Average-case analysis of best-first search in two representative directed acyclic graphs, Artificial Intelligence, v.155 n.1-2, p.183-206, May 2004
Sven Koenig , Maxim Likhachev , Yaxin Liu , David Furcy, Incremental heuristic search in AI, AI Magazine, v.25 n.2, p.99-112, Summer 2004
H. Yu , A. Reyes , S. Cang , S. Lloyd, Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems-part I: Petri net modelling and heuristic search, Computers and Industrial Engineering, v.44 n.4, p.527-543, April 2003
Reza Zamani, An Effective Near-Optimal State-Space Search Method: An Application to a Scheduling Problem, Artificial Intelligence Review, v.22 n.1, p.41-69, September 2004
Anthony C. Kam , Gary E. Kopec, Document Image Decoding by Heuristic Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.18 n.9, p.945-950, September 1996
Josefina Sierra-Santibáñez, Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning, Annals of Mathematics and Artificial Intelligence, v.39 n.1-2, p.61-100, September 2003
H. Yoo , S. Lafortune, An Intelligent Search Method for Query Optimization by Semijoins, IEEE Transactions on Knowledge and Data Engineering, v.1 n.2, p.226-237, June 1989
Ning Jing , Yun-Wu Huang , Elke A. Rundensteiner, Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation, IEEE Transactions on Knowledge and Data Engineering, v.10 n.3, p.409-432, May 1998
U. Lorenz , B. Monien, Error analysis in minimax trees, Theoretical Computer Science, v.313 n.3, p.485-498, 19 February 2004
Keqin Li, Analysis of randomized load distribution for reproduction trees in linear arrays and rings, Theoretical Computer Science, v.321 n.2-3, p.195-214, 16 August 2004
Marc Cavazza , Fred Charles , Steven J. Mead, Emergent situations in interactive storytelling, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain
Hermann Kaindl , Reza Shams , Helmut Horacek, Minimax Search Algorithms With and Without Aspiration Windows, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.12, p.1225-1235, December 1991
Feng-hsiung Hsu, IBM's Deep Blue Chess Grandmaster Chips, IEEE Micro, v.19 n.2, p.70-81, March 1999
Sudeshna Sarkar , P. p. Chakrabarti , Sujoy Ghose, A Framework for Learning in Search-Based Systems, IEEE Transactions on Knowledge and Data Engineering, v.10 n.4, p.563-575, July 1998
Ananth Grama , Vipin Kumar, State of the Art in Parallel Search Techniques for Discrete Optimization Problems, IEEE Transactions on Knowledge and Data Engineering, v.11 n.1, p.28-35, January 1999
Vijay S. Mookerjee , Michael V. Mannino, Sequential Decision Models for Expert System Optimization, IEEE Transactions on Knowledge and Data Engineering, v.9 n.5, p.675-687, September 1997
Karen I. Trovato , Leo Dorst, Differential A*, IEEE Transactions on Knowledge and Data Engineering, v.14 n.6, p.1218-1229, November 2002
J. Rocha , T. Pavlidis, A Shape Analysis Model with Applications to a Character Recognition System, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.4, p.393-404, April 1994
B Wah , G J Li, Survey on special purpose computer architectures for AI, ACM SIGART Bulletin
Thomas Ellman , Fausto Giunchiglia, Introduction to the special volume on reformulation, Artificial Intelligence, v.162 n.1-2, p.3-5, February 2005
K. B. Irani , S. I. Yoo, A Methodology for Solving Problems: Problem Modeling and Heuristic Generation, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.10 n.5, p.676-686, September 1988
Keqin Li, Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks, Performance Evaluation, v.60 n.1-4, p.141-163, May 2005
Abdel-Elah Al-Ayyoub, Performance evaluation of parallel iterative deepening A* on clusters of workstations, Performance Evaluation, v.60 n.1-4, p.223-236, May 2005
Masashi Shimbo , Toru Ishida, Controlling the learning process of real-time heuristic search, Artificial Intelligence, v.146 n.1, p.1-41, May 2003
Sara Gradara , Antonella Santone , Maria Luisa Villani, Using heuristic search for finding deadlocks in concurrent systems, Information and Computation, v.202 n.2, p.191-226, 1 November, 2005
Abdel-Elah Al-Ayyoub, Distributed Unidirectional and Bidirectional Heuristic Search: Algorithm Design and Empirical Assessment, The Journal of Supercomputing, v.32 n.3, p.231-250, June 2005
Sven Koenig , Maxim Likhachev , David Furcy, Lifelong planning A*, Artificial Intelligence, v.155 n.1-2, p.93-146, May 2004
Andrew Sohn, A Parallel Implementation of the Traveling Salesman Problem on a Sequent Symmetry Mulitprocessor, Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, p.273-280, January 20-22, 1993
Jia-Shung Wang , R. C. T. Lee, An Efficient Channel Routing Algorithm to Yield an Optimal Solution, IEEE Transactions on Computers, v.39 n.7, p.957-962, July 1990
Toru Ishida, Real-Time Bidirectional Search: Coordinated Problem Solving in Uncertain Situations, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.18 n.6, p.617-628, June 1996
Russell Greiner , Ryan Hayward , Magdalena Jankowska , Michael Molloy, Finding optimal satisficing strategies for and-or trees, Artificial Intelligence, v.170 n.1, p.19-58, January 2006
H. H. L. M. Donkers , H. J. van den Herik , J. W. H. M. Uiterwijk, Selecting evaluation functions in opponent-model search, Theoretical Computer Science, v.349 n.2, p.245-267, 14 December 2005
A. Sadikov , I. Bratko , I. Kononenko, Bias and pathology in minimax search, Theoretical Computer Science, v.349 n.2, p.268-281, 14 December 2005
Lorenz Lercher , Hermann Kaindl, Problems, communications, and common sense, ACM SIGART Bulletin, v.3 n.2, p.15-19, April 1992
Jean-François Bérubé , Jean-Yves Potvin , Jean Vaucher, Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem, Computers and Operations Research, v.33 n.6, p.1838-1856, June 2006
L. Fu , D. Sun , L. R. Rilett, Heuristic shortest path algorithms for transportation applications: state of the art, Computers and Operations Research, v.33 n.11, p.3324-3343, November 2006
Dong-Jun Lee , Hyejeong Lee , Dong-Ho Cho, Effective paging strategy based on location probability of mobile station and paging load distribution of base station in mobile communication networks, Wireless Networks, v.12 n.3, p.395-402, May 2006
Sharlee Climer , Weixiong Zhang, Cut-and-solve: an iterative search strategy for combinatorial optimization problems, Artificial Intelligence, v.170 n.8, p.714-738, June 2006
V. N. Rao , V. Kumar, On the Efficiency of Parallel Backtracking, IEEE Transactions on Parallel and Distributed Systems, v.4 n.4, p.427-437, April 1993
H. H. L. M. Donkers , J. W. H. M. Uiterwijk , H. J. van den Herik, Admissibility in opponent-model search, Information Sciences—Informatics and Computer Science: An International Journal, v.154 n.3-4, p.119-140, September 2003
CHRIS REED , DOUGLAS WALTON , FABRIZIO MACAGNO, Argument diagramming in logic, law and artificial intelligence, The Knowledge Engineering Review, v.22 n.1, p.87-109, March 2007
Farhad Arbab , Eric Monfroy, Coordination of heterogeneous distributed cooperative constraint solving, ACM SIGAPP Applied Computing Review, v.6 n.2, p.4-17, Sept. 1998
Claude G. Diderich, A bibliography on minimax trees, ACM SIGACT News, v.24 n.4, p.82-89, Dec. 1993
Sara Gradara , Antonella Santone , Maria Luisa Villani, DELFIN+: An efficient deadlock detection tool for CCS processes, Journal of Computer and System Sciences, v.72 n.8, p.1397-1412, December, 2006
Ian Read , Stephen Cox, Stochastic and syntactic techniques for predicting phrase breaks, Computer Speech and Language, v.21 n.3, p.519-542, July, 2007
Arindam Mukherjee , Anup Kumar Sen , Amitava Bagchi, The representation, analysis and verification of business processes: a metagraph-based approach, Information Technology and Management, v.8 n.1, p.65-81, March 2007
Violeta Tomašević , Slobodan Bojanić , Octavio Nieto-Taladriz, Finding an internal state of RC4 stream cipher, Information Sciences: an International Journal, v.177 n.7, p.1715-1727, April, 2007
Sara Gradara , Antonella Santone , Maria Luisa Villani, Formal Verification of Concurrent Systems via Directed Model Checking, Electronic Notes in Theoretical Computer Science (ENTCS), 185, p.93-105, July, 2007
Sven Koenig , Maxim Likhachev, Real-time adaptive A*, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, May 08-12, 2006, Hakodate, Japan
Xiaochun Yang , Chen Li, Secure XML publishing without information leakage in the presence of data inference, Proceedings of the Thirtieth international conference on Very large data bases, p.96-107, August 31-September 03, 2004, Toronto, Canada
Song-Chun Zhu , David Mumford, A stochastic grammar of images, Foundations and Trends® in Computer Graphics and Vision, v.2 n.4, p.259-362, January 2006
Samee Ullah Khan , Ishfaq Ahmad, Comparison and analysis of ten static heuristics-based Internet data replication techniques, Journal of Parallel and Distributed Computing, v.68 n.2, p.113-136, February, 2008
David Stern , Ralf Herbrich , Thore Graepel, Learning to solve game trees, Proceedings of the 24th international conference on Machine learning, p.839-846, June 20-24, 2007, Corvalis, Oregon
Barrett W. Thomas , Chelsea C. White, III, Anticipatory Route Selection, Transportation Science, v.38 n.4, p.473-487, November 2004
A. Schaerf, A Survey of Automated Timetabling, Artificial Intelligence Review, v.13 n.2, p.87-127, April 1999
E. J. van Henten , J. Hemming , B. A. J. van Tuijl , J. G. Kornet , J. Meuleman , J. Bontsema , E. A. van Os, An Autonomous Robot for Harvesting Cucumbers in Greenhouses, Autonomous Robots, v.13 n.3, p.241-258, November 2002
Hoon Hong, Heuristic search and pruning in polynomial constraints satisfaction, Annals of Mathematics and Artificial Intelligence, v.19 n.3-4, p.319-334, 1997
Sven Koenig , Boleslaw Szymanski , Yaxin Liu, Efficient and inefficient ant coverage methods, Annals of Mathematics and Artificial Intelligence, v.31 n.1-4, p.41-76, 2001
François Laburthe , Yves Caseau, SALSA: A Language for Search Algorithms, Constraints, v.7 n.3-4, p.255-288, July-October 2002
Rakesh Agrawal , H. V. Jagadish, Efficient Search in Very Large Databases, Proceedings of the 14th International Conference on Very Large Data Bases, p.407-418, August 29-September 01, 1988
Zhiru Zhang , Yiping Fan , Miodrag Potkonjak , Jason Cong, Gradual Relaxation Techniques with Applications to Behavioral Synthesis, Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design, p.529, November 09-13, 2003
Sven Koenig, A Comparison of Fast Search Methods for Real-Time Situated Agents, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, p.864-871, July 19-23, 2004, New York, New York
D. P. Rodohan , R. J. Glover, An overview of the A architecture for optimisation problems in a logic programming environment, ACM SIGARCH Computer Architecture News, v.19 n.4, p.124-131, June 1991
Henri Farreny, Completeness and Admissibility for General Heuristic Search Algorithms—A Theoretical Study: Basic Concepts and Proofs, Journal of Heuristics, v.5 n.3, p.353-376, October 1999
Stefan Ratschan, Search Heuristics for Box Decomposition Methods, Journal of Global Optimization, v.24 n.1, p.35-49, September 2002
Jörg Caumanns, Bottom-Up Generation of Hypermedia Documents, Multimedia Tools and Applications, v.12 n.2-3, p.109-128, November 2000
Rune M. Jensen , Manuela M. Veloso , Randal E. Bryant, State-set branching: Leveraging BDDs for heuristic search, Artificial Intelligence, v.172 n.2-3, p.103-139, February, 2008
Jens Gramm , Jiong Guo , Falk Hüffner , Rolf Niedermeier , Hans-Peter Piepho , Ramona Schmid, Algorithms for compact letter displays: Comparison and evaluation, Computational Statistics & Data Analysis, v.52 n.2, p.725-736, October, 2007
Maxim Likhachev , Dave Ferguson , Geoff Gordon , Anthony Stentz , Sebastian Thrun, Anytime search in dynamic graphs, Artificial Intelligence, v.172 n.14, p.1613-1643, September, 2008
Keith So, Enforcing long-path timing closure for FPGA routing with path searches on clamped lexicographic spirals, Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays, February 24-26, 2008, Monterey, California, USA
Xiaoxun Sun , Sven Koenig , William Yeoh, Generalized Adaptive A*, Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems, May 12-16, 2008, Estoril, Portugal
Sven Koenig , Maxim Likhachev , Xiaoxun Sun, Speeding up moving-target search, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii
Andreas Wichert , João Dias Pereira , Paulo Carreira, Visual search light model for mental problem solving, Neurocomputing, v.71 n.13-15, p.2806-2822, August, 2008
B. Moses Sathyaraj , L. C. Jain , A. Finn , S. Drake, Multiple UAVs path planning algorithms: a comparative study, Fuzzy Optimization and Decision Making, v.7 n.3, p.257-267, September 2008
Liang Lin , Tianfu Wu , Jake Porway , Zijian Xu, A stochastic graph grammar for compositional object representation and recognition, Pattern Recognition, v.42 n.7, p.1297-1307, July, 2009
Sven Koenig , Xiaoxun Sun, Comparing real-time and incremental heuristic search for real-time situated agents, Autonomous Agents and Multi-Agent Systems, v.18 n.3, p.313-341, June 2009
E. J. Van Henten , D. A. Van't Slot , C. W. J. Hol , L. G. Van Willigenburg, Optimal manipulator design for a cucumber harvesting robot, Computers and Electronics in Agriculture, v.65 n.2, p.247-257, March, 2009
Alla Safonova , Jessica K. Hodgins, Construction and optimal search of interpolated motion graphs, ACM Transactions on Graphics (TOG), v.26 n.3, July 2007
Yew Jin Lim , Wee Sun Lee, Properties of forward pruning in game-tree search, proceedings of the 21st national conference on Artificial intelligence, p.1020-1025, July 16-20, 2006, Boston, Massachusetts
German Rodriguez , Ramon Beivide , Cyriel Minkenberg , Jesus Labarta , Mateo Valero, Exploring pattern-aware routing in generalized fat tree networks, Proceedings of the 23rd international conference on Supercomputing, June 08-12, 2009, Yorktown Heights, NY, USA
Enn Tyugu, Algorithms and Architectures of Artificial Intelligence, Proceeding of the 2007 conference on Algorithms and Architectures of Artificial Intelligence, p.1-171, June 09, 2007
Xiaoxun Sun , William Yeoh , Sven Koenig, Dynamic fringe-saving A*, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, May 10-15, 2009, Budapest, Hungary
William B. Lund , Eric K. Ringger, Improving optical character recognition through efficient multiple system alignment, Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries, June 15-19, 2009, Austin, TX, USA
Geoffrey I. Webb, OPUS: an efficient admissible algorithm for unordered search, Journal of Artificial Intelligence Research, v.3 n.1, p.431-465, June 1995
Rina Dechter, Mini-buckets: a general scheme for generating approximations in automated reasoning, Proceedings of the Fifteenth international joint conference on Artifical intelligence, p.1297-1302, August 23-29, 1997, Nagoya, Japan
Weixiong Zhang, Phase transitions and backbones of the asymmetric traveling salesman problem, Journal of Artificial Intelligence Research, v.21 n.1, p.471-497, January 2004
Patrik Haslum, Improving heuristics through relaxed search: an analysis of TP4 and HSPa* in the 2004 planning competition, Journal of Artificial Intelligence Research, v.25 n.1, p.233-267, January 2006
Pedro F. Felzenszwalb , David McAllester, The generalized A* architecture, Journal of Artificial Intelligence Research, v.29 n.1, p.153-190, May 2007
Eric A. Hansen , Rong Zhou, Anytime heuristic search, Journal of Artificial Intelligence Research, v.28 n.1, p.267-297, January 2007
Daniel B. Leifker , Laveen N. Kanal, A hybrid SSS*/alpha-beta algorithm for parallel search of game trees, Proceedings of the 9th international joint conference on Artificial intelligence, p.1044-1046, August 18-23, 1985, Los Angeles, California
Anup K. Sen , A. Bagchi, Fast recursive formulations for best-first search that allow controlled use of memory, Proceedings of the 11th international joint conference on Artificial intelligence, p.297-302, August 20-25, 1989, Detroit, Michigan
Nicolas Meuleau , Emmanuel Benazera , Ronen I. Brafman , Eric A. Hansen , Mausam Mausam, A heuristic search approach to planning with continuous resources in stochastic domains, Journal of Artificial Intelligence Research, v.34 n.1, p.27-59, January 2009
Peter D. Turney, Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm, Journal of Artificial Intelligence Research, v.2 n.1, p.369-409, August 1994
Howard E. Motteler , Laveen N. Kanal, The complexity of searching several classes of AND/OR graphs, Proceedings of the 9th international joint conference on Artificial intelligence, p.1083-1085, August 18-23, 1985, Los Angeles, California
Charles Elkan, Conspiracy numbers and caching for searching and/or trees and theorem-proving, Proceedings of the 11th international joint conference on Artificial intelligence, p.341-346, August 20-25, 1989, Detroit, Michigan
Jack Mostow , Armand E. Prieditis, Discovering admissible heuristics by abstracting and optimizing: a transformational approach, Proceedings of the 11th international joint conference on Artificial intelligence, p.701-707, August 20-25, 1989, Detroit, Michigan
Lev Finkelstein , Shaul Markovitch, A selective macro-learning algorithm and its application to the N × N sliding-tile puzzle, Journal of Artificial Intelligence Research, v.8 n.1, p.223-263, January 1998
Malte Helmert , Patrik Haslum , Jörg Hoffmann, Explicit-state abstraction: a new method for generating heuristic functions, Proceedings of the 23rd national conference on Artificial intelligence, p.1547-1550, July 13-17, 2008, Chicago, Illinois
Subir Bhattacharya , A. Bagchi, Searching game trees in parallel using SSS*, Proceedings of the 11th international joint conference on Artificial intelligence, p.42-47, August 20-25, 1989, Detroit, Michigan
Alexander Reinefeld, Complete solution of the eight-puzzle and the benefit of node ordering in IDA, Proceedings of the 13th international joint conference on Artifical intelligence, p.248-253, August 28-September 03, 1993, Chambery, France
Maxim Likhachev , Anthony Stentz, R* search, Proceedings of the 23rd national conference on Artificial intelligence, p.344-350, July 13-17, 2008, Chicago, Illinois
Carmel Domshlak , Jörg Hoffmann, Probabilistic planning via heuristic forward search and weighted model counting, Journal of Artificial Intelligence Research, v.30 n.1, p.565-620, September 2007
Malte Helmert , Gabriele Röger, How good is almost perfect?, Proceedings of the 23rd national conference on Artificial intelligence, p.944-949, July 13-17, 2008, Chicago, Illinois
Hermann Kaindl , Gerhard Kainz, Bidirectional heuristic search reconsidered, Journal of Artificial Intelligence Research, v.7 n.1, p.283-317, July 1997
Andreas L. Koll , Hermann Kaindl, Bidirectional best-first search with bounded error: summary of results, Proceedings of the 13th international joint conference on Artifical intelligence, p.217-223, August 28-September 03, 1993, Chambery, France
Bart Selman, Stochastic search and phase transitions: AI meets physics, Proceedings of the 14th international joint conference on Artificial intelligence, p.998-1002, August 20-25, 1995, Montreal, Quebec, Canada
Sandip Aine , P. P. Chakrabarti , Rajeev Kumar, AWA*-a window constrained anytime heuristic search algorithm, Proceedings of the 20th international joint conference on Artifical intelligence, p.2250-2255, January 06-12, 2007, Hyderabad, India
Ron Bekkerman , Shlomo Zilberstein , James Allan, Web page clustering using heuristic search in the web graph, Proceedings of the 20th international joint conference on Artifical intelligence, p.2280-2285, January 06-12, 2007, Hyderabad, India
Subir Bhattacharya, Experimenting with revisits in game tree search, Proceedings of the 14th international joint conference on Artificial intelligence, p.243-249, August 20-25, 1995, Montreal, Quebec, Canada
Takahiro Sasaki , Fumihiko Chimura , Mario Tokoro, The trailblazer search with a hierarchical abstract map, Proceedings of the 14th international joint conference on Artificial intelligence, p.259-264, August 20-25, 1995, Montreal, Quebec, Canada
Silvia Coradeschi , Thierry Vidal, Highly reactive decision making: a game with time, Proceedings of the 16th international joint conference on Artificial intelligence, p.1002-1007, July 31-August 06, 1999, Stockholm, Sweden
Patrice Perny , Olivier Spanjaard , Louis-Xavier Storme, State space search for risk-averse agents, Proceedings of the 20th international joint conference on Artifical intelligence, p.2353-2358, January 06-12, 2007, Hyderabad, India
Xiaoxun Sun , Marek J. Druzdzel , Changhe Yuan, Dynamic weighting A* search-based MAP algorithm for Bayesian networks, Proceedings of the 20th international joint conference on Artifical intelligence, p.2385-2390, January 06-12, 2007, Hyderabad, India
Xiaoxun Sun , Sven Koenig, The fringe-saving A* search algorithm: a feasibility study, Proceedings of the 20th international joint conference on Artifical intelligence, p.2391-2397, January 06-12, 2007, Hyderabad, India
James Clune, Heuristic evaluation functions for general game playing, Proceedings of the 22nd national conference on Artificial intelligence, p.1134-1139, July 22-26, 2007, Vancouver, British Columbia, Canada
Hang Dinh , Alexander Russell , Yuan Su, On the value of good advice: the complexity of A* search with accurate heuristics, Proceedings of the 22nd national conference on Artificial intelligence, p.1140-1145, July 22-26, 2007, Vancouver, British Columbia, Canada
Torsten Sander , Philipp Wehner, On A☆ search with stopover areas, International Journal of Geographical Information Science, v.23 n.6, p.799-819, June 2009
Betsy George , Shashi Shekhar, SP-TAG: a routing algorithm in non-stationary transportation networks, Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services, July 21-25, 2008, Dublin, Ireland
Maxim Likhachev , Dave Ferguson, Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles, International Journal of Robotics Research, v.28 n.8, p.933-945, August 2009
Armand E. Prieditis, Machine discovery of effective admissible heuristics, Proceedings of the 12th international joint conference on Artificial intelligence, p.720-725, August 24-30, 1991, Sydney, New South Wales, Australia
Eugene C. Freuder , Rina Dechter , Matthew L. Ginsberg , Bart Selman , Edward Tsang, Systematic versus stochastic constraint satisfaction, Proceedings of the 14th international joint conference on Artificial intelligence, p.2027-2032, August 20-25, 1995, Montreal, Quebec, Canada
Sven Koenig , Reid G. Simmons, Real-time search in non-deterministic domains, Proceedings of the 14th international joint conference on Artificial intelligence, p.1660-1667, August 20-25, 1995, Montreal, Quebec, Canada
Elena Sánchez-Nielsen , Mario Hernández-Tejera, An heuristic search based approach for moving objects tracking, Proceedings of the 19th international joint conference on Artificial intelligence, p.1736-1737, July 30-August 05, 2005, Edinburgh, Scotland
David Furcy , Sven Koenig, Limited discrepancy beam search, Proceedings of the 19th international joint conference on Artificial intelligence, p.125-131, July 30-August 05, 2005, Edinburgh, Scotland
Reza Shams , Hermann Kaindl , Helmut Horacek, Using aspiration windows for minimax algorithms, Proceedings of the 12th international joint conference on Artificial intelligence, p.192-197, August 24-30, 1991, Sydney, New South Wales, Australia
Stephen V. Chenoweth , Henry W. Davis, High-performance A* search using rapidly growing heuristics, Proceedings of the 12th international joint conference on Artificial intelligence, p.198-203, August 24-30, 1991, Sydney, New South Wales, Australia
Toru Ishida , Richard E. Korf, Moving target search, Proceedings of the 12th international joint conference on Artificial intelligence, p.204-210, August 24-30, 1991, Sydney, New South Wales, Australia
Mausam Mausam , Emmanuel Benazera , Ronen Brafman , Nicolas Meuleau , Eric A. Hansen, Planning with continuous resources in stochastic domains, Proceedings of the 19th international joint conference on Artificial intelligence, p.1244-1251, July 30-August 05, 2005, Edinburgh, Scotland
Xiaoxun Sun , William Yeoh , Po-An Chen , Sven Koenig, Simple optimization techniques for A*-based search, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, May 10-15, 2009, Budapest, Hungary
C. V. Apté , R. A. Dionne , J. H. Griesmer , M. Karnaugh , J. K. Kastner , M. M. Laker , E. K. Mays, An experiment in constructing an open expert system using a knowledge substrate, IBM Journal of Research and Development, v.36 n.3, p.409-434, May 1992
Xiaoxun Sun , William Yeoh , Sven Koenig, Efficient incremental search for moving target search, Proceedings of the 21st international jont conference on Artifical intelligence, p.615-620, July 11-17, 2009, Pasadena, California, USA
Zhifu Zhang , Nathan R. Sturtevant , Robert Holte , Jonathan Schaeffer , Ariel Felner, A* search with inconsistent heuristics, Proceedings of the 21st international jont conference on Artifical intelligence, p.634-639, July 11-17, 2009, Pasadena, California, USA
Thomas Ellman , Fausto Giunchiglia, Introduction to the Special Volume on Reformulation, Artificial Intelligence, v.162 n.1-2, p.3-5, February 2005
Adrian Walker, Knowledge systems: Principles and practice, IBM Journal of Research and Development, v.30 n.1, p.2-13, Jan. 1986
Chia-Lung Wu , Po-Ning Chen , Yunghsiang S. Han , Ming-Hsin Kuo, Maximum-likelihood priority-first search decodable codes for combined channel estimation and error correction, IEEE Transactions on Information Theory, v.55 n.9, p.4191-4203, September 2009
Russell Greiner , Ryan Hayward , Magdalena Jankowska , Michael Molloy, Finding optimal satisficing strategies for and-or trees, Artificial Intelligence, v.170 n.1, p.19-58, January 2006
Sharlee Climer , Weixiong Zhang, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Artificial Intelligence, v.170 n.8-9, p.714-738, June, 2006
Radu Marinescu , Rina Dechter, Memory intensive AND/OR search for combinatorial optimization in graphical models, Artificial Intelligence, v.173 n.16-17, p.1492-1524, November, 2009
Radu Marinescu , Rina Dechter, AND/OR Branch-and-Bound search for combinatorial optimization in graphical models, Artificial Intelligence, v.173 n.16-17, p.1457-1491, November, 2009
Patricia E. N. Lutu , Andries P. Engelbrecht, A decision rule-based method for feature selection in predictive data mining, Expert Systems with Applications: An International Journal, v.37 n.1, p.602-609, January, 2010
Samir K. Sadhukhan , Swarup Mandai , Saroj R. Biswas , Partha Bhaumik , Debashis Saha, Post-deployment tuning of UMTS cellular networks through dual-homing of RNCs, Proceedings of the First international conference on COMmunication Systems And NETworks, p.532-541, January 05-10, 2009, Bangalore, India
Stan Kurkovsky, Experimenting with IDA* search algorithm in heterogeneous pervasive environments, Artificial Intelligence Review, v.29 n.3-4, p.277-286, June 2008

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods

Additional Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.1 Applications and Expert Systems
          Subjects: Games


General Terms:
Algorithms, Experimentation, Performance, Theory


REVIEW

"Stanley Wertheimer : Reviewer"

There is no generally accepted definition of the word heuristic; however, most interested parties agree that a heuristic is a rule-of-thumb, an educated g uess, the application of intuition or common sense, or inductive intelligence. S even  more...

Collaborative Colleagues:
Judea Pearl: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player