{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:50:48Z","timestamp":1743069048741,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287886"},{"type":"electronic","value":"9783642287893"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28789-3_10","type":"book-chapter","created":{"date-parts":[[2012,4,26]],"date-time":"2012-04-26T06:01:53Z","timestamp":1335420113000},"page":"219-241","source":"Crossref","is-referenced-by-count":0,"title":["A Knowledge-Based Operator for a Genetic Algorithm which Optimizes the Distribution of Sparse Matrix Data"],"prefix":"10.1007","author":[{"given":"Una-May","family":"O\u2019Reilly","sequence":"first","affiliation":[]},{"given":"Nadya","family":"Bliss","sequence":"additional","affiliation":[]},{"given":"Sanjeev","family":"Mohindra","sequence":"additional","affiliation":[]},{"given":"Julie","family":"Mullen","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Robinson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Biriukov, A., Ulyanov, D.: Simulation of parallel time-critical programs with the dynamo system. In: Proceedings of the Third IEEE Conference on Control Applications, pp. 825\u2013829. IEEE Computer Society (1994), doi:10.1109\/CCA.1994.381214","DOI":"10.1109\/CCA.1994.381214"},{"issue":"3","key":"10_CR2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1177\/1094342007078446","volume":"21","author":"N. Bliss","year":"2007","unstructured":"Bliss, N., Kepner, J.: pMatlab Parallel MATLAB Library. International Journal of High Performance Computing Applications (IJHPCA), Special Issue on High-Productivity Programming Languages and Models\u00a021(3), 336\u2013359 (2007)","journal-title":"International Journal of High Performance Computing Applications (IJHPCA), Special Issue on High-Productivity Programming Languages and Models"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Challenges and advances in parallel sparse matrix-matrix multiplication. In: The 37th International Conference on Parallel Processing (ICPP 2008), pp. 503\u2013510. IEEE Computer Society (2008)","DOI":"10.1109\/ICPP.2008.45"},{"key":"10_CR4","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: New ideas in sparse matrix-matrix multiplication. In: Kepner, J., Gilbert, J.R. (eds.) Graph Algorithms in the Language of Linear Algebra. SIAM Press (2008)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: A recursive model for graph mining. In: SIAM Data Mining SDM 2004 (2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-006-1224-z","volume":"47","author":"P. D\u2019Alberto","year":"2007","unstructured":"D\u2019Alberto, P., Nicolau, A.: R-kleene: A high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks. Algorithmica\u00a047(2), 203\u2013213 (2007)","journal-title":"Algorithmica"},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"T.A. Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/365723.365732","volume":"26","author":"S. Filippone","year":"2000","unstructured":"Filippone, S., Colajanni, M.: Psblas: a library for parallel linear algebra computation on sparse matrices. ACM Trans. Math. Softw.\u00a026(4), 527\u2013550 (2000)","journal-title":"ACM Trans. Math. Softw."},{"issue":"6","key":"10_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM\u00a05(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Foo, S.K., Saratchandran, P., Sundararajan, N.: Genetic algorithm based pattern allocation schemes for training set parallelism in backpropagation neural networks. In: IEEE International Conference on Evolutionary Computation, pp. 545\u2013550. IEEE Computer Society (1995), doi:10.1109\/ICEC.1995.487442","DOI":"10.1109\/ICEC.1995.487442"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MCSE.2008.45","volume":"10","author":"J.R. Gilbert","year":"2008","unstructured":"Gilbert, J.R., Reinhardt, S., Shah, V.B.: A unified framework for numerical and combinatorial computing. Computing in Science and Engg.\u00a010(2), 20\u201325 (2008)","journal-title":"Computing in Science and Engg."},{"key":"10_CR12","unstructured":"Grefenstette, J.J.: Incorporating problem-specific knowledge into genetic algorithms. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing,\u00a0ch. 4, pp. 42\u201360. Morgan Kaufmann (1987)"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"2489","DOI":"10.1145\/1274000.1274015","volume-title":"Proceedings of the 2007 Genetic and Evolutionary Computation Conference, GECCO 2007","author":"M.I. Hosny","year":"2007","unstructured":"Hosny, M.I., Mumford, C.L.: Single vehicle pickup and delivery with time windows: made to measure genetic encoding and operators. In: Proceedings of the 2007 Genetic and Evolutionary Computation Conference, GECCO 2007, pp. 2489\u20132496. ACM, New York (2007), \n                    http:\/\/doi.acm.org\/10.1145\/1274000.1274015\n                  , doi:10.1145\/1274000.1274015"},{"key":"10_CR15","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. Du","year":"1986","unstructured":"Du, I.S., Erisman, A., Reid, J.K.: Direct Methods for Sparse Matrices. Oxford University Press, Oxford (1986)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Jose, A.: An approach to mapping parallel programs on hypercube multiprocessors. In: Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing, PDP 1999, pp. 221\u2013225 (1999), doi:10.1109\/EMPDP.1999.746675","DOI":"10.1109\/EMPDP.1999.746675"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kalinowski, T.: Solving the mapping problem with a genetic algorithm on the maspar-1. In: Proceedings of the First International Conference on Massively Parallel Computing Systems, pp. 370\u2013374. IEEE Computer Society (1994), doi:10.1109\/MPCS.1994.367057","DOI":"10.1109\/MPCS.1994.367057"},{"key":"10_CR18","unstructured":"Kepner, J., Bliss, N., Robinson, E.: Linear algebraic graph algorithms for back end processing. In: Proceedings of Workshop on High Performance Embedded Computing, HPEC 2008 (2008)"},{"key":"10_CR19","volume-title":"High Performance Computing: Challenges for Future Systems","author":"D. Kuck","year":"1996","unstructured":"Kuck, D.: High Performance Computing: Challenges for Future Systems. Oxford University Press, New York (1996)"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y.K. Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys\u00a031(4), 406\u2013471 (1999), \n                    http:\/\/doi.acm.org\/10.1145\/344588.344618\n                  , doi:10.1145\/344588.344618","journal-title":"ACM Computing Surveys"},{"key":"10_CR21","first-page":"771","volume-title":"IJCAI 1983: Proceedings of the Eighth International Joint Conference on Artificial intelligence","author":"J.E. Laird","year":"1983","unstructured":"Laird, J.E., Newell, A.: A universal weak method: summary of results. In: IJCAI 1983: Proceedings of the Eighth International Joint Conference on Artificial intelligence, pp. 771\u2013773. Morgan Kaufmann Publishers Inc., San Francisco (1983)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/1375527.1375558","volume-title":"ICS 2008: Proceedings of the 22nd Annual International Conference on Supercomputing","author":"S. Lee","year":"2008","unstructured":"Lee, S., Eigenmann, R.: Adaptive runtime tuning of parallel sparse matrix-vector multiplication on distributed memory systems. In: ICS 2008: Proceedings of the 22nd Annual International Conference on Supercomputing, pp. 195\u2013204. ACM, New York (2008)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Lin, W.Y.: Parallel sparse matrix ordering: quality improvement using genetic algorithms. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, pp. 2295\u20132301. IEEE Computer Society (1999), doi:10.1109\/CEC.1999.785560","DOI":"10.1109\/CEC.1999.785560"},{"key":"10_CR24","unstructured":"O\u2019Reilly, U., Bliss, N., Mohindra, S., Mullen, J., Robinson, E.: Multi-objective optimization of sparse array computations. In: Proceedings of Workshop on High Performance Embedded Computing, HPEC 2009 (2009)"},{"issue":"4","key":"10_CR25","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(89)90005-9","volume":"10","author":"M.O. Rabin","year":"1989","unstructured":"Rabin, M.O., Vazirani, V.V.: Maximum matchings in general graphs through randomization. J. Algorithms\u00a010(4), 557\u2013567 (1989)","journal-title":"J. Algorithms"},{"key":"10_CR26","unstructured":"Ramaswamy, S., Banerjee, P.: Automatic generation of efficient array redistribution routines for distributed memory multicomputers. In: Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers 1995). IEEE Computer Society (1995)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Reuther, A., Kepner, J., McCabe, A., Mullen, J., Bliss, N., Kim, H.: Technical challenges of supporting interactive HPC. In: HPCMP Users Group Conference, pp. 403\u2013409. IEEE Computer Society (2007)","DOI":"10.1109\/HPCMP-UGC.2007.72"},{"key":"10_CR28","unstructured":"Robinson, E.: Array based betweenness centrality. In: SIAM Conference on Parallel Processing for Scientific Computing (2008)"},{"key":"10_CR29","volume-title":"Iterative methods for sparse linear systems","author":"Y. Sadd","year":"2007","unstructured":"Sadd, Y.: Iterative methods for sparse linear systems. SIAM, Philadelphia (2007)"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Talbi, E.G., Muntean, T.: Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem. In: Proceeding of the Twenty-Sixth Hawaii International Conference on System Sciences, pp. 565\u2013573. IEEE Computer Society (1993), doi:10.1109\/HICSS.1993.284069","DOI":"10.1109\/HICSS.1993.284069"},{"issue":"3","key":"10_CR31","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/322261.322272","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: A unified approach to path problems. J. ACM\u00a028(3), 577\u2013593 (1981)","journal-title":"J. ACM"},{"key":"10_CR32","unstructured":"Travinin, N., Hoffman, H., Bond, R., Chan, H., Kepner, J., Wong, E.: pMapper: Automatic mapping of parallel matlab programs. In: HPCMP Users Group Conference, pp. 254\u2013261. IEEE Computer Society (2005)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Travinin Bliss, N., Mohindra, S., O\u2019Reilly, U.: Performance modeling and mapping of sparse computations. In: HPCMP Users Group Conference, pp. 448\u2013456. IEEE Computer Society (2008)","DOI":"10.1109\/DoD.HPCMP.UGC.2008.66"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Xiong, K., Suh, S., Yang, M., Yang, J., Arabnia, H.: Next generation sequence analysis using genetic algorithms on multi-core technology. In: International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS 2009), pp. 190\u2013191 (2009), doi:10.1109\/IJCBS.2009.104","DOI":"10.1109\/IJCBS.2009.104"},{"key":"10_CR35","unstructured":"Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., Catalyurek, U.: A scalable distributed parallel breadth-first search algorithm on BlueGene\/L. In: Proceedings of the 2005 ACM\/IEEE Conference on Supercomputing, SC 2005, p. 25. IEEE Computer Society, Washington, DC (2005)"},{"key":"10_CR36","first-page":"254","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004","author":"R. Yuster","year":"2004","unstructured":"Yuster, R., Zwick, U.: Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 254\u2013260. Society for Industrial and Applied Mathematics, Philadelphia (2004)"}],"container-title":["Studies in Computational Intelligence","Parallel Architectures and Bioinspired Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28789-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T01:22:13Z","timestamp":1676769733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-28789-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287886","9783642287893"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28789-3_10","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2012]]}}}