{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:12:15Z","timestamp":1750911135670,"version":"3.41.0"},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2017edp7073","type":"journal-article","created":{"date-parts":[[2017,9,30]],"date-time":"2017-09-30T22:24:46Z","timestamp":1506810286000},"page":"2505-2514","source":"Crossref","is-referenced-by-count":7,"title":["A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Shan","family":"DING","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"ZENG","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"KURACHI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruifeng","family":"HUANG","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] C.R. Houck, J. Joines, and M.G. Kay, \u201cA genetic algorithm for function optimization: a Matlab implementation,\u201d NCSU-IETR 95.09, 1995."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] U.D. Bordoloi and S. Samii, \u201cThe Frame Packing Problem for CAN-FD,\u201d 2014 IEEE Real-Time Systems Symposium, pp.284-293, 2014. 10.1109\/rtss.2014.8","DOI":"10.1109\/RTSS.2014.8"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K. Deb, et al., \u201cA fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II,\u201d Parallel problem solving from nature PPSN VI, Springer Berlin Heidelberg, 2000.","DOI":"10.1007\/3-540-45356-3_83"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D. Whitley, \u201cAn executable model of a simple genetic algorithm,\u201d Foundations of genetic algorithms, vol.2, pp.45-62, 2014.","DOI":"10.1016\/B978-0-08-094832-4.50009-X"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J. Grefenstette, J. Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms. Psychology Press, 2013.","DOI":"10.4324\/9780203761595"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] F. Polzlbauer, I. Bate, and E. Brenner, \u201cOptimized frame packing for embedded systems,\u201d IEEE Embedded Syst. Lett., vol.4, no.3, pp.65-68, 2012. 10.1109\/les.2012.2208094","DOI":"10.1109\/LES.2012.2208094"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] P. Roy, P. Roy, and A. Chakrabarti, \u201cModified shuffled frog leaping algorithm with genetic algorithm crossover for solving economic load dispatch problem with valve-point effect,\u201d Applied Soft Computing, vol.13, no.11, pp.4244-4252, 2013. 10.1016\/j.asoc.2013.07.006","DOI":"10.1016\/j.asoc.2013.07.006"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] R. Saket and N. Navet, \u201cFrame packing algorithms for automotive applications,\u201d J. Embedded Computing, 2(1), 2006.","DOI":"10.3233\/EMC-2006-00063"},{"key":"9","unstructured":"[9] K. Sandstrom, C. Norstom, and M. Ahlmark, \u201cFrame packing in real-time communication,\u201d In RTCSA, 2000."},{"key":"10","unstructured":"[10] F. Hartwich, \u201cCAN with flexible data-rate,\u201d International CAN Conference, 2012."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] R.I. Davis, A. Burns, R.J. Bril, and J.J. Lukkien, \u201cController area network (CAN) schedulability analysis: Refuted, revisited and revised,\u201d Real-Time Systems, vol.35, no.3, pp.239-272, 2007. 10.1007\/s11241-007-9012-7","DOI":"10.1007\/s11241-007-9012-7"},{"key":"12","unstructured":"[12] N.C. Audsley and Y. Dd, Optimal Priority Assignment And Feasibility Of Static Priority Tasks With Arbitrary Start Times[J]. 2000."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/10\/E100.D_2017EDP7073\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T23:37:11Z","timestamp":1750894631000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/10\/E100.D_2017EDP7073\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":12,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017edp7073","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}