{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:54:22Z","timestamp":1725501262577},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540777038"},{"type":"electronic","value":"9783540777045"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77704-5_13","type":"book-chapter","created":{"date-parts":[[2008,1,19]],"date-time":"2008-01-19T01:28:36Z","timestamp":1200706116000},"page":"152-163","source":"Crossref","is-referenced-by-count":0,"title":["Towards Generic Solver of Combinatorial Optimization Problems with Autonomous Agents in P2P Networks"],"prefix":"10.1007","author":[{"given":"Shigeaki","family":"Tagashira","sequence":"first","affiliation":[]},{"given":"Masaya","family":"Mito","sequence":"additional","affiliation":[]},{"given":"Satoshi","family":"Fujita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: ICSI workshop on Design Issues in Anonymity and Unobsevability, pp. 46\u201366 (July 2000)","DOI":"10.1007\/3-540-44702-4_4"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018952429396","volume":"90","author":"J. Clausen","year":"1999","unstructured":"Clausen, J., Perregaard, M.: On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search. Annals of Operations Research\u00a090(1), 1\u201317 (1999)","journal-title":"Annals of Operations Research"},{"key":"13_CR3","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proc. IJCAI 1999, pp. 548\u2013553 (1999)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Fujita, S., Tagashira, S., Qiao, C., Mito, M.: Distributed Branch-and-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions. In: Proc. AINA 2005, March 28\u201330, 2005, Tamkang University, Taiwan (2005)","DOI":"10.1109\/AINA.2005.165"},{"key":"13_CR5","unstructured":"Gnutella, http:\/\/gnutella.wego.com\/"},{"key":"13_CR6","unstructured":"Portable Parallel Branch-and-Bound Library, http:\/\/wwwcs.upb.de\/fachbereich\/AG\/monien\/SOFTWARE\/PPBB\/ppbblib.html"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Sakurai, Y., Yokoo, M., Kamei, K.: An efficient approximate algorithm for winner determination in combinatorial auctions. In: ACM Conf. on Electronic Commerce, pp. 30\u201337 (2000)","DOI":"10.1145\/352871.352875"},{"issue":"1-2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence\u00a0135(1-2), 1\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"13_CR9","volume-title":"Human Behavior and Principle of Least Effort","author":"G.K. Zipf","year":"1949","unstructured":"Zipf, G.K.: Human Behavior and Principle of Least Effort. Addison-Wesley, Boston (1949)"}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77704-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:49:22Z","timestamp":1619520562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77704-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540777038","9783540777045"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77704-5_13","relation":{},"subject":[]}}