{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T18:40:41Z","timestamp":1683657641970},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,11,11]],"date-time":"2006-11-11T00:00:00Z","timestamp":1163203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2007,1,18]]},"DOI":"10.1007\/s10489-006-0006-2","type":"journal-article","created":{"date-parts":[[2006,11,10]],"date-time":"2006-11-10T18:37:10Z","timestamp":1163183830000},"page":"35-52","source":"Crossref","is-referenced-by-count":6,"title":["Using genetic algorithms to reorganize superpeer structure in peer to peer networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Jaymin","family":"Kessler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Rasheed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Budak","family":"Arpinar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,11]]},"reference":[{"key":"6_CR1","unstructured":"Robert E, Beverly IV (2004) Reorganization in network regions for optimality and fairness. MSc Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, August 2004"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Koo SGM, Lee CSG, Kannan K (2004) A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks. In: Proceedings of the 13th IEEE international conference on computer communications and networks (ICCCN\u201904), Chicago, IL, October 2004","DOI":"10.1109\/ICCCN.2004.1401710"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Kalnis P, Ng WS, Ooi BC, Papadias D, Tan KL (2002) An adaptive peer to peer network for distributed caching of OLAP results. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, Wisconsin, pp 25\u201336","DOI":"10.1145\/564691.564695"},{"issue":"1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5\u201330","journal-title":"J Heuristics"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Cooper BF, Garcia-Molina H (2002) Peer-to-peer resource trading in a reliable distributed system. In: Electronic proceedings of the 1st international workshop on peer-to-peer systems (IPTPS \u201902), Cambridge, MA, March 2002","DOI":"10.1007\/3-540-45748-8_30"},{"key":"6_CR6","unstructured":"Androutsellis-Theotokis S (2002) A survey of peer-to-peer file sharing technologies. White paper, electronic trading research unit (ELTRUN), Athens University of Economics and Business, 2002"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Michaelwicz Z (1998) Genetic algorithms + data structures = evolution programs. Springer-Verlag, 3rd, rev. and extended ed. 1996. Corr. 2nd printing","DOI":"10.1007\/978-3-662-03315-9"},{"key":"6_CR8","unstructured":"Resource description framework (RDF) model and syntax specification. W3C Recommendation, February 1999 ( http:\/\/www.w3.org\/TR\/REC-rdf-syntax\/ )"},{"key":"6_CR9","unstructured":"ATIS Telecom Glossary, The alliance for telecommunications industry solutions, February 2001 ( http:\/\/www.atis.org\/tg2k\/_network_architecture.html )"},{"key":"6_CR10","unstructured":"Comer DE, Stevens D (1996) Internetworking with TCP\/IP, vol III. Prentice Hall, May 1997, p 513"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Lv Q, Ratnasamy S, Shenker S (2002) Can heterogeneity make gnutella scalable. In: Electronic proceedings of the 1st international workshop on peer-to-peer systems (IPTPS \u201902), Cambridge, MA, March 2002","DOI":"10.1007\/3-540-45748-8_9"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Adar E, Huberman B (2000) Free riding on gnutella. First Monday, vol 5, Number 10\u2013October 2nd, 2000","DOI":"10.5210\/fm.v5i10.792"},{"key":"6_CR13","unstructured":"Sripanidkulchai K. The popularity of gnutella queries and its implications on scalability. Featured on O\u2019Reilly\u2019s http:\/\/www.openp2p.com website, February 2001"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M (2001) Compressed bloom filters. In: Proceedings of the 20th annual ACM symposium on principles of distributed computing, pp 144\u2013150","DOI":"10.1145\/383962.384004"},{"key":"6_CR15","first-page":"340","volume-title":"Computers and intractability\u2014a guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability\u2014a guide to the theory of np-completeness. W. H. Freeman And Company, New York, p 340"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0006-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-006-0006-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0006-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T18:20:47Z","timestamp":1683656447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-006-0006-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,11]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1,18]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s10489-006-0006-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,11]]}}}