{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:00:19Z","timestamp":1777125619376,"version":"3.51.4"},"reference-count":43,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4008,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0004-3702(02)00228-x","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T20:43:49Z","timestamp":1031604229000},"page":"71-106","source":"Crossref","is-referenced-by-count":8,"title":["Nagging: A scalable fault-tolerant paradigm for distributed search"],"prefix":"10.1016","volume":"140","author":[{"given":"Alberto Maria","family":"Segre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Forman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Resta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Wildenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00228-X_BIB001","doi-asserted-by":"crossref","unstructured":"D. Applegate, R. Bixby, W. Cook, and V. Chv\u00e1tal, On the solution of traveling salesman problems, Technical Report 98744, Center for Research on Parallel Computation, Rice University, Houston, TX, July 1998","DOI":"10.4171\/dms\/1-3\/62"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB002","series-title":"PVM Users Guide and Reference Manual","author":"Beguelin","year":"1994"},{"issue":"2","key":"10.1016\/S0004-3702(02)00228-X_BIB003","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/jpdc.1999.1600","article-title":"APHID: Asynchronous parallel game-tree search","volume":"60","author":"Brockington","year":"2000","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0004-3702(02)00228-X_BIB004","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1613\/jair.518","article-title":"Adaptive parallel iterative deepening search","volume":"9","author":"Cook","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00228-X_BIB005","series-title":"Proc. 3rd Annual ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"issue":"7","key":"10.1016\/S0004-3702(02)00228-X_BIB006","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB007","doi-asserted-by":"crossref","unstructured":"W. Ertel, Performance analysis of competitive or-parallel theorem proving, Technische Universit\u00e4t M\u00fcnchen, FKI-162-91, 1992","DOI":"10.1007\/BFb0013064"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB008","series-title":"Advances in Computer Chess VII","first-page":"203","article-title":"Game tree search on a massively parallel system","author":"Feldmann","year":"1994"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB009","series-title":"Proc. AAAI-88, St. Paul, MN","first-page":"128","article-title":"Distributed tree search and its application to alpha-beta pruning","author":"Ferguson","year":"1988"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB010","unstructured":"S.L. Forman, Torsion angle selection and emergent non-local secondary structure in protein structure prediction, Ph.D. Thesis, Department of Mathematics, The University of Iowa, Iowa City, IA, August 2001"},{"issue":"2","key":"10.1016\/S0004-3702(02)00228-X_BIB011","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1177\/109434209701100205","article-title":"Globus: A metacomputing infrastructure toolkit","volume":"11","author":"Foster","year":"1997","journal-title":"Internat. J. Supercomput. Appl. High Performance Comput."},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00228-X_BIB012","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","article-title":"Heavy-tailed phenomena in satisfiability and constraint satisfaction problems","volume":"24","author":"Gomes","year":"2000","journal-title":"J. Automat. Reasoning"},{"issue":"4","key":"10.1016\/S0004-3702(02)00228-X_BIB013","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/ijoc.7.4.365","article-title":"Parallel search algorithms for discrete optimization problems","volume":"7","author":"Grama","year":"1995","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10.1016\/S0004-3702(02)00228-X_BIB014","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/69.755612","article-title":"State of the art in parallel search techniques for discrete optimization problems","volume":"11","author":"Grama","year":"1999","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"issue":"6","key":"10.1016\/S0004-3702(02)00228-X_BIB015","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/0167-8191(96)00024-5","article-title":"A high-performance, portable implementation of the MPI message-passing interface standard","volume":"22","author":"Gropp","year":"1996","journal-title":"Parallel Comput."},{"key":"10.1016\/S0004-3702(02)00228-X_BIB016","series-title":"Satisfiability Problem: Theory and Applications","first-page":"19","article-title":"Algorithms for the satisfiability (SAT) problem: A survey","author":"Gu","year":"1997"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB017","series-title":"Proc. Third DIMACS Parallel Implementation Challenge, Rutgers University, Rutgers, NJ","article-title":"Massively parallel chess","author":"Joerg","year":"1994"},{"issue":"4","key":"10.1016\/S0004-3702(02)00228-X_BIB018","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/S0004-3702(02)00228-X_BIB019","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/S0004-3702(02)00228-X_BIB020","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch and bound methods: A survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(02)00228-X_BIB021","series-title":"Statistical Methods for Survival Data Analysis","author":"Lee","year":"1992"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB022","series-title":"Proc. Eighth Conference on Distributed Computing Systems, San Jose, CA","article-title":"Condor: A hunter of idle workstations","author":"Litzkow","year":"1988"},{"issue":"2","key":"10.1016\/S0004-3702(02)00228-X_BIB023","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(93)90003-T","article-title":"A SIMD approach to parallel heuristic search","volume":"60","author":"Mahanti","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB024","series-title":"Methods for Statistical Analysis of Reliability and Life Data","author":"Mann","year":"1974"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB025","series-title":"Statistical Methods for Reliability Data","author":"Meeker","year":"1998"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB026","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB027","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1147\/rd.24.0320","article-title":"Chess playing programs and the problem of complexity","volume":"2","author":"Newell","year":"1958","journal-title":"IBM J. Res. Development"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB028","series-title":"Problem-Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB029","series-title":"Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp","author":"Norvig","year":"1992"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB030","series-title":"Proc. Fifth International Conference of the Society for Computational Economics","article-title":"Extending the computational horizon: Effective distributed resource-bounded computation for intractable problems","author":"Paarsch","year":"1999"},{"issue":"2","key":"10.1016\/S0004-3702(02)00228-X_BIB031","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0004-3702(93)90002-S","article-title":"Depth-first heuristic search on a SIMD machine","volume":"60","author":"Powley","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB032","series-title":"Proc. 1994 Scalable High-Performance Computing Conference","first-page":"773","article-title":"Work-load balancing in highly parallel depth-first search","author":"Reinefeld","year":"1994"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB033","series-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"Reinelt","year":"1994"},{"issue":"2","key":"10.1016\/S0004-3702(02)00228-X_BIB034","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00114163","article-title":"A critical look at experimental evaluations of EBL","volume":"6","author":"Segre","year":"1991","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB035","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"187","article-title":"Using hundreds of workstations to solve first-order logic problems","author":"Segre","year":"1994"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB036","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB037","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","article-title":"Generating hard satisfiability problems","volume":"81","author":"Selman","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB038","first-page":"720","article-title":"EDF statistics for goodness of fit and some comparisons","volume":"69","author":"Stephens","year":"1974","journal-title":"J. Amer. Statist. Soc."},{"issue":"3","key":"10.1016\/S0004-3702(02)00228-X_BIB039","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/A:1005885725562","article-title":"Nagging: A distributed adversarial search-pruning technique applied to first-order logic","volume":"19","author":"Sturgill","year":"1997","journal-title":"J. Automat. Reasoning"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB040","series-title":"Proc. Twelfth Conference on Automated Deduction","first-page":"484","article-title":"A novel asynchronous parallelization scheme for first-order logic","author":"Sturgill","year":"1994"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB041","unstructured":"C. Whittinghill, Social choice and resource allocation in a professional sports league, Ph.D. Thesis, Department of Economics, The University of Iowa, Iowa City, IA, 1999"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB042","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biometrics"},{"key":"10.1016\/S0004-3702(02)00228-X_BIB043","series-title":"State-Space Search: Algorithms, Complexity, Extensions, and Applications","author":"Zhang","year":"1999"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020200228X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020200228X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T12:05:40Z","timestamp":1704197140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S000437020200228X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S000437020200228X"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00228-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}