{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:27:00Z","timestamp":1725582420991},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642205194"},{"type":"electronic","value":"9783642205200"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20520-0_6","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T08:23:08Z","timestamp":1303892588000},"page":"51-60","source":"Crossref","is-referenced-by-count":6,"title":["A Population Based Incremental Learning for Delay Constrained Network Coding Resource Minimization"],"prefix":"10.1007","author":[{"given":"Huanlai","family":"Xing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network coding flow. IEEE Trans. Inform. Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.Y.R. Li","year":"2003","unstructured":"Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inform. Theory\u00a049(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Kim, M., Ahn, C.W., M\u00e9dard, M., Effros, M.: On minimizing network coding resources: an evolutionary approach. In: Proc. NetCod. (2006)","DOI":"10.1109\/INFCOM.2007.231"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Kim, M., M\u00e9dard, M., Aggarwal, V., O\u2019Reilly, V., Kim, W., Ahn, C.W., Effros, M.: Evolutionary approaches to minimizing network coding resources. In: Proc. Inforcom (2007)","DOI":"10.1109\/INFCOM.2007.231"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-71805-5_3","volume-title":"Applications of Evolutionary Computing","author":"M. Kim","year":"2007","unstructured":"Kim, M., Aggarwal, V., O\u2019Reilly, V., M\u00e9dard, M., Kim, W.: Genetic representations for evolutionary minimization of network coding resources. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol.\u00a04448, pp. 21\u201331. Springer, Heidelberg (2007)"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/TIT.2005.864435","volume":"52","author":"C. Fragouli","year":"2006","unstructured":"Fragouli, C., Soljanin, E.: Information flow decomposition for network coding. IEEE Trans. Inform. Theory\u00a052(3), 829\u2013848 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TIT.2006.874434","volume":"52","author":"M. Langberg","year":"2006","unstructured":"Langberg, M., Sprintson, A., Bruck, J.: The encoding complexity of network coding. IEEE Trans. Inform. Theory\u00a052(6), 2386\u20132397 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bhattad, K., Ratnakar, N., Koetter, R., Narayanan, K.R.: Minimal network coding for multicast. In: Proc. ISIT 2005 (2005)","DOI":"10.1109\/ISIT.2005.1523641"},{"key":"6_CR9","unstructured":"Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University (1994)"},{"key":"6_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation","author":"P. Larranaga","year":"2002","unstructured":"Larranaga, P., Lozano, J.A.: Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, Norwell (2002)"},{"key":"6_CR11","unstructured":"Goldberg, V.: A new max-flow algorithm. Technical Report MIT\/LCS\/TM-291, MIT (1985)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20520-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:15:04Z","timestamp":1558588504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20520-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205194","9783642205200"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20520-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}