{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:59:01Z","timestamp":1752361141230},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573968"},{"type":"electronic","value":"9783540481331"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bfb0018645","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T01:24:01Z","timestamp":1140139441000},"page":"11-41","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Prioritization in parallel symbolic computing"],"prefix":"10.1007","author":[{"given":"L. V.","family":"Kale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Ramkumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Saletore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. B.","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"2_CR1","unstructured":"Burton F. W. Controlling Speculative Computation in a Parallel Functional Language. In International Conference on Distributed Computer Systems, pages 453\u2013458, November 1985."},{"key":"2_CR2","volume-title":"Master's thesis","author":"T. T. Einarsson","year":"1993","unstructured":"Einarsson, Thorr T. Bidirectional Search in Parallel. Master's thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, July 1993."},{"key":"2_CR3","volume-title":"Master's thesis","author":"W. Fenton","year":"1991","unstructured":"Fenton, Wayne. Additions to the chare kernel parallel programming system, and its usefulness for parallel state-space search. Master's thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, 1991."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Furuichi, M., Taki, K. and Ichiyoshi, N. A Multi-level Load Balancing Scheme for OR-parallel Exhaustive Search Programs on the Multi-PSI. In PPOPP, pages 50\u201359, March 1990.","DOI":"10.1145\/99164.99170"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Halstead R. Parallel Symbolic Computing. Computer, August 1986.","DOI":"10.1109\/MC.1986.1663306"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Hausman B. Pruning and Speculative Work in OR-Parallel PROLOG. PhD thesis, Royal Institute of Technology, 1990.","DOI":"10.1007\/3-540-51285-3_38"},{"key":"2_CR7","unstructured":"L. V. Kale and W. Shu. The Chare Kernel language for parallel programming: A perspective. Technical Report UIUCDCS-R-88-1451, Department of Computer Science, University of Illinois, August 1988."},{"issue":"1","key":"2_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(91)90009-E","volume":"11","author":"L.V. Kale","year":"1991","unstructured":"L.V. Kale. The REDUCE OR process model for parallel execution of logic programs. Journal of Logic Programming, 11(1):55\u201384, July 1991.","journal-title":"Journal of Logic Programming"},{"key":"2_CR9","unstructured":"Kale L.V. Parallel Execution of Logic Programs: The REDUCE-OR Process Model. In International Conference on Logic Programming, pages 616\u2013632, Melbourne, May 1987."},{"key":"2_CR10","unstructured":"Kale L.V. A Tree Representation for Parallel Problem Solving. in National Conference on Artificial Intelligence (AAAI), St. Paul, August 1988."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Kale L.V. An Almost Perfect Heuristic for the N-Queens Problem. In Information Processing Letters, April 1990.","DOI":"10.1016\/0020-0190(90)90156-R"},{"key":"2_CR12","unstructured":"Kale L.V. The Chare-Kernel Parallel Programming Language and System. In International Conference on Parallel Processing, August 1990."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kale L.V. and Saletore V.A. Parallel State-Space Search for a First Solution with Consistent Linear Speedups. International Journal of Parallel Programming, August 1990.","DOI":"10.1007\/BF01379360"},{"key":"2_CR14","unstructured":"Kale L.V. and Warren D.S. Class of Architectures for a PROLOG Machine. In International Conference on Logic Programming, pages 171\u2013182, Stockholm, Sweden, June 1985."},{"key":"2_CR15","unstructured":"Kale L.V., Ramkumar B. and Shu W. A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs. In The 5th International Conference\/Symposium on Logic Programming, pages 1223\u20131240, Seattle, August 1988."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Korf R.E. Depth-first Iterative Deepening: An Optimal Admissible Tree Search. In Artificial Intelligence, pages 97\u2013109, 1985.","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Korf R.E. Optimal Path-Finding Algorithms. In Search in Artificial Intelligence, pages 223\u2013267. Springer-Verlag, 1988.","DOI":"10.1007\/978-1-4613-8788-6_7"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kumar Vipin and Rao V. Nageshwar. Parallel Depth First Search. Part 2: Analysis. International Journal of Parallel Programming, pages 501\u2013519, December 1987.","DOI":"10.1007\/BF01389001"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Lai T.H. and Sahni Sartaj. Anomalies in Parallel Branch-and-Bound Algorithms. In Communications of the ACM, pages 594\u2013602, June 1984.","DOI":"10.1145\/358080.358103"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Li G.J. and Wah B.W. Coping with Anomalies in Parallel Branch-and-Bound Algorithms. In IEEE Transactions on Computers, pages 568\u2013573, June 1986.","DOI":"10.1109\/TC.1986.5009434"},{"key":"2_CR21","volume-title":"Master's thesis","author":"C. Low","year":"1991","unstructured":"Low, Chin-Chau. Parallel game tree searching with lower and upper bounds. Master's thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, 1991."},{"key":"2_CR22","unstructured":"Nilsson N. J. Principles of Artificial Intelligence. Tioga Press, Inc., 1980."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"R. Osborne. Speculative computation in multilisp. In Lecture Notes in Computer Science, number 441. Springer-Verlag, 1990.","DOI":"10.1145\/91556.91644"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"R. Osborne. Speculative computation in multilisp: An overview. In ACM Conference on Lisp and Functional Programming, 1990.","DOI":"10.1145\/91556.91644"},{"key":"2_CR25","unstructured":"B. Ramkumar and L.V. Kale. Machine independent AND and OR parallel execution of logic programs: Part II-compiled execution. To appear in IEEE Transactions on Parallel and Distributed Systems, 1991."},{"key":"2_CR26","unstructured":"Ramkumar B. and Kale L.V. Compiled Execution of the REDUCE-OR Process Model on Multiprocessors. In North American Conference on Logic Programming, pages 313\u2013331, October 1989."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Ramkumar, B., Banerjee P. Portable Parallel Test Generation for Sequential Circuits. In Proceedings of the International Conference on Computer-Aided Design, November 1992.","DOI":"10.1109\/ICCAD.1992.279371"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Rao V. Nageshwara and Kumar Vipin. Parallel Depth First Search. Part 1: Implementation. International Journal of Parallel Programming, pages 479\u2013499, December 1987.","DOI":"10.1007\/BF01389000"},{"key":"2_CR29","volume-title":"PhD thesis","author":"V.A. Saletore","year":"1990","unstructured":"Saletore, V.A. Machine Independent Parallel Execution of Speculative Computations. PhD thesis, Dept. Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, September 1990."},{"key":"2_CR30","unstructured":"Saletore V.A. and Kale L.V. Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs. In North American Conference on Logic Programming, pages 390\u2013406, October 1989."},{"key":"2_CR31","unstructured":"Saletore V.A. and Kale L.V. Consistent Linear Speedups to a First Solution in Parallel State-Space Search. In The Eighth National Conference on Artificial Intelligence (AAAI-90), Boston, Mass., July 1990."},{"key":"2_CR32","unstructured":"Saletore V.A. and Kale L.V. Efficient Parallel Execution of IDA* on Shared and Distributed Memory Multiprocessors. In Proceedings of the Sixth Distributed Memory Computing Conference (DMCC6), Portland, OR, April 1991."},{"key":"2_CR33","unstructured":"Saletore V.A. and Mohammed M.A. A Hierarchical Load Distribution Scheme for Branch-and-Bound Computations on Distributed Memory Machines. Technical Report 93-80-04, Dept. of Computer Science, Oregon State University, January 1993."},{"key":"2_CR34","volume-title":"Technical Report UIUCDCS-R-90-1725","author":"V.A. Saletore","year":"1990","unstructured":"Saletore V.A., Ramkumar B., and Kale L.V. Consistent First Solution Speedups in OR-Parallel Execution of Logic Programs. Technical Report UIUCDCS-R-90-1725, Dept. of Computer Science, University of Illinois at Urbana-Champaign, April 1990."},{"key":"2_CR35","unstructured":"Sen A.K. and Bagchi A. Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. In International Joint Conference on Artificial Intelligence, pages 297\u2013302, August 1989."},{"key":"2_CR36","unstructured":"A. B. Sinha and L. V. Kale. A load balancing strategy for prioritized execution of tasks. In International Parallel Processing Symposium, April 1993."},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Stone Harold S. and Stone Janice M. Efficient search techniques-An empirical study of the N-Queens Problem. IBM Journal of Research and Development, pages 464\u2013474, July 1987.","DOI":"10.1147\/rd.314.0464"}],"container-title":["Lecture Notes in Computer Science","Parallel Symbolic Computing: Languages, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T12:28:53Z","timestamp":1580300933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573968","9783540481331"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/bfb0018645","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}